| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqtr | GIF version | ||
| Description: Transitive law for class equality. Proposition 4.7(3) of [TakeutiZaring] p. 13. (Contributed by NM, 25-Jan-2004.) |
| Ref | Expression |
|---|---|
| eqtr | ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2212 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 = 𝐶 ↔ 𝐵 = 𝐶)) | |
| 2 | 1 | biimpar 297 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1470 ax-gen 1472 ax-4 1533 ax-17 1549 ax-ext 2187 |
| This theorem depends on definitions: df-bi 117 df-cleq 2198 |
| This theorem is referenced by: eqtr2 2224 eqtr3 2225 sylan9eq 2258 eqvinc 2896 eqvincg 2897 uneqdifeqim 3546 preqsn 3816 dtruex 4607 relresfld 5212 relcoi1 5214 eqer 6652 xpider 6693 addlsub 8442 bj-findis 15915 |
| Copyright terms: Public domain | W3C validator |