| 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 5642 | . . 3 ⊢ ( E We 𝐴 → E Or 𝐴) | |
| 2 | sotr 5584 | . . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) | |
| 3 | 1, 2 | sylan 592 | . 2 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) |
| 4 | epel 5554 | . . 3 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦) | |
| 5 | epel 5554 | . . 3 ⊢ (𝑦 E 𝑧 ↔ 𝑦 ∈ 𝑧) | |
| 6 | 4, 5 | anbi12i 640 | . 2 ⊢ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧)) |
| 7 | epel 5554 | . 2 ⊢ (𝑥 E 𝑧 ↔ 𝑥 ∈ 𝑧) | |
| 8 | 3, 6, 7 | 3imtr3g 298 | 1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2144 class class class wbr 5102 E cep 5550 Or wor 5558 We wwe 5603 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-eprel 5551 df-po 5559 df-so 5560 df-we 5606 |
| This theorem is used by: wefrc 5645 ordelord 6387 |
| Copyright terms: Public domain | W3C validator |