Class Equality is Transitive
Jump to navigation
Jump to search
Theorem
Let $A$, $B$, and $C$ be classes.
Let $=$ denote class equality.
Then
- $\left({ A = B \land B = C }\right) \implies B = A$
Proof
This page is beyond the scope of ZFC, and should not be used in anything other than the theory in which it resides.
If you see any proofs that link to this page, please insert this template at the top.
If you believe that the contents of this page can be reworked to allow ZFC, then you can discuss it at the talk page.
By Universal Generalisation and Biconditional is Transitive:
- $\forall x: \left({ \left({ x \in A \iff x \in B }\right) \land \left({ x \in B \iff x \in C }\right) }\right) \implies \forall x: \left({ x \in A \iff x \in C }\right)$ by Universal Generalisation and Biconditional is Transitive
This article, or a section of it, needs explaining. In particular: Further explanation needs to be added here to explain why this constitutes a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by explaining it. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Explain}} from the code. |
$\blacksquare$
Sources
- 1971: Gaisi Takeuti and Wilson M. Zaring: Introduction to Axiomatic Set Theory: $\S 4.7 \ (3)$