| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wecmpep | Structured version Visualization version GIF version | ||
| Description: The elements of a class well-ordered by membership are comparable. (Contributed by NM, 17-May-1994.) |
| Ref | Expression |
|---|---|
| wecmpep | ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | weso 5632 | . 2 ⊢ ( E We 𝐴 → E Or 𝐴) | |
| 2 | solin 5576 | . . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 E 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 E 𝑥)) | |
| 3 | epel 5544 | . . . 4 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦) | |
| 4 | biid 261 | . . . 4 ⊢ (𝑥 = 𝑦 ↔ 𝑥 = 𝑦) | |
| 5 | epel 5544 | . . . 4 ⊢ (𝑦 E 𝑥 ↔ 𝑦 ∈ 𝑥) | |
| 6 | 3, 4, 5 | 3orbi123i 1156 | . . 3 ⊢ ((𝑥 E 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 E 𝑥) ↔ (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)) |
| 7 | 2, 6 | sylib 218 | . 2 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)) |
| 8 | 1, 7 | sylan 580 | 1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ w3o 1085 ∈ wcel 2109 class class class wbr 5110 E cep 5540 Or wor 5548 We wwe 5593 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-br 5111 df-opab 5173 df-eprel 5541 df-so 5550 df-we 5596 |
| This theorem is referenced by: tz7.7 6361 |
| Copyright terms: Public domain | W3C validator |