Regarding the assembly $\tau_{z}((y|x)A)$ ($y$ does not appear in $A$) in the case $z=x$. I do understand the method if we apply CS3 to simplify that, but if I try to simplify it from first principles, something wrong happens, here is how I did it. "The operation replaces all $x$ in (A with all $x$ replaced by $y$) with $\square$, since there is no $x$ in the bracket, the operation is identical with $(y|x)A$. But if we apply CS3 we would get $\tau_{y}((y|x)A)$, which essentially replace all x with $\square$. The two different outcomes confuse me, could you help please? Thank you very much.
2026-03-27 04:18:43.1774585123
An inquiry on the proof of CF6 in Bourbaki's Theory of Sets
82 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ELEMENTARY-SET-THEORY
- how is my proof on equinumerous sets
- Composition of functions - properties
- Existence of a denumerble partition.
- Why is surjectivity defined using $\exists$ rather than $\exists !$
- Show that $\omega^2+1$ is a prime number.
- A Convention of Set Builder Notation
- I cannot understand that $\mathfrak{O} := \{\{\}, \{1\}, \{1, 2\}, \{3\}, \{1, 3\}, \{1, 2, 3\}\}$ is a topology on the set $\{1, 2, 3\}$.
- Problem with Cartesian product and dimension for beginners
- Proof that a pair is injective and surjective
- Value of infinite product
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in PREDICATE-LOGIC
- Find the truth value of... empty set?
- What does Kx mean in this equation? [in Carnap or Russell and Whitehead's logical notation]
- Exchanging RAA with double negation: is this valid?
- Logical Connectives and Quantifiers
- Is this proof correct? (Proof Theory)
- Is there only a finite number of non-equivalent formulas in the predicate logic?
- Are Proofs of Dependent Pair Types Equivalent to Finding an Inverse Function?
- How to build a list of all the wfs (well-formed sentences)?
- Translations into logical notation
- What would be the function to make a formula false?
Related Questions in QUANTIFIERS
- Show formula which does not have quantifier elimination in theory of infinite equivalence relations.
- Prove or disprove: $\exists x \forall y \,\,\varphi \models \forall y \exists x \,\ \varphi$
- Variables, Quantifiers, and Logic
- Express least and greatest fixed point using predicate and quantifiers
- Nested Quantifiers - Excluding Self
- Logical Equivalences Involving Quantifiers
- Translating Propositional Functions
- Valid Set builder notations for simple set.
- Explanation about quantifier sequence ∀x∃y and ∃y∀x
- Contrapositive of a quantified statement
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The author is proving the rule for substitution of a varibale in a formula $A$.
The substitution is written as $(y|x)A$.
The propositional cases are striaghtforward; the only issue is with the quantifier $\tau_z$.
If $A$ is $\tau_z (A')$, we have three sub-cases :
(i) $z$ is different form both $x$ and $y$: thus, we can freely subst $y$ in place of $x$ and the result is : $(y|x)A := \tau_z [(y|x)A']$. This is CS4.
Example: $A$ is $\tau_z(x \in z)$. The result of the substitution will be $(y|x)A := \tau_z(y \in z)$.
(ii) $z$ is identical $x$. In modern terms, this means that $x$ is not free in $A$, and thus we cannot subst it with $y$. Thus, the result is the original formula $\tau_z(A) := \tau_x(A)$.
But a quantfied variable can be renamed, provided that we use a new variable; thus, due to the fact that $y$ does not occur into $A$, we have that $\tau_x(A) := \tau_y(A')$. This is CS3.
Example: in this case, let $A$ is $\tau_x(x \in w)$. In "formal" notation [see page 17], this is $\tau (\square \in z)$ where $\square$ is a "place-holder".
As you can see, there is no $x$ to be replaced, and thus $(y|x)[\tau (\square \in z)$ will be $\tau (\square \in z)$, that can be re-written as $\tau_y(y \in z)$.
(iii) $z$ is identical with $y$. In this case, we cannot put $y$ in place of $x$, because if we do so, the new occurrence of $y$ into $A$ will be "captured" by the quantifier $\tau_y$.
Thus, we have to rename the quantified variable with a new variable $u$ to get : $\tau_u(A)$ and then subst $y$ in place of $x$ to get : $(y|x)[\tau_u(A)] := \tau_u(A')$.
Example: $A$ is $\tau_z(x \in z)$. The result of the substitution will be $(y|x)A := (y|x)[\tau_y(x \in y)] := (y|x)[\tau_u(x \in u)] := \tau_u(y \in u)$.