| 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 5623 | . . 3 ⊢ ( E We 𝐴 → E Or 𝐴) | |
| 2 | sotr 5565 | . . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) | |
| 3 | 1, 2 | sylan 581 | . 2 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) |
| 4 | epel 5535 | . . 3 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦) | |
| 5 | epel 5535 | . . 3 ⊢ (𝑦 E 𝑧 ↔ 𝑦 ∈ 𝑧) | |
| 6 | 4, 5 | anbi12i 629 | . 2 ⊢ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧)) |
| 7 | epel 5535 | . 2 ⊢ (𝑥 E 𝑧 ↔ 𝑥 ∈ 𝑧) | |
| 8 | 3, 6, 7 | 3imtr3g 295 | 1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 class class class wbr 5100 E cep 5531 Or wor 5539 We wwe 5584 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-eprel 5532 df-po 5540 df-so 5541 df-we 5587 |
| This theorem is referenced by: wefrc 5626 ordelord 6347 |
| Copyright terms: Public domain | W3C validator |