| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wetrep | Structured version Visualization version GIF version | ||
| Description: On a class well-ordered by membership, the membership predicate is transitive. (Contributed by NM, 22-Apr-1994.) |
| Ref | Expression |
|---|---|
| wetrep | ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | weso 5652 | . . 3 ⊢ ( E We 𝐴 → E Or 𝐴) | |
| 2 | sotr 5594 | . . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) | |
| 3 | 1, 2 | sylan 591 | . 2 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) |
| 4 | epel 5564 | . . 3 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦) | |
| 5 | epel 5564 | . . 3 ⊢ (𝑦 E 𝑧 ↔ 𝑦 ∈ 𝑧) | |
| 6 | 4, 5 | anbi12i 639 | . 2 ⊢ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧)) |
| 7 | epel 5564 | . 2 ⊢ (𝑥 E 𝑧 ↔ 𝑥 ∈ 𝑧) | |
| 8 | 3, 6, 7 | 3imtr3g 298 | 1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 ∈ wcel 2143 class class class wbr 5109 E cep 5560 Or wor 5568 We wwe 5613 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-eprel 5561 df-po 5569 df-so 5570 df-we 5616 |
| This theorem is referenced by: wefrc 5655 ordelord 6382 |
| Copyright terms: Public domain | W3C validator |