| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Axiom of Equality. One of the equality and substitution axioms for a non-logical predicate in our predicate calculus with equality. It substitutes equal variables into the right-hand side of the ∈ binary predicate. Axiom scheme C13' in [Megill] p. 448 (p. 16 of the preprint). It is a special case of Axiom B8 (p. 75) of system S2 of [Tarski] p. 77. |
| Ref | Expression |
|---|---|
| ax-14 | ⊢ (x = y → (z ∈ x → z ∈ y)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vx | . . . 4 set x | |
| 2 | 1 | cv 953 | . . 3 class x |
| 3 | vy | . . . 4 set y | |
| 4 | 3 | cv 953 | . . 3 class y |
| 5 | 2, 4 | wceq 954 | . 2 wff x = y |
| 6 | vz | . . . . 5 set z | |
| 7 | 6 | cv 953 | . . . 4 class z |
| 8 | 7, 2 | wcel 956 | . . 3 wff z ∈ x |
| 9 | 7, 4 | wcel 956 | . . 3 wff z ∈ y |
| 10 | 8, 9 | wi 3 | . 2 wff (z ∈ x → z ∈ y) |
| 11 | 5, 10 | wi 3 | 1 wff (x = y → (z ∈ x → z ∈ y)) |
| Colors of variables: wff set class |
| This axiom is referenced by: elequ2 1135 dtruALT 2743 fv3 3724 elirrv 4578 |