| 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 5645 | . 2 ⊢ ( E We 𝐴 → E Or 𝐴) | |
| 2 | solin 5588 | . . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 E 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 E 𝑥)) | |
| 3 | epel 5556 | . . . 4 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦) | |
| 4 | biid 261 | . . . 4 ⊢ (𝑥 = 𝑦 ↔ 𝑥 = 𝑦) | |
| 5 | epel 5556 | . . . 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 2108 class class class wbr 5119 E cep 5552 Or wor 5560 We wwe 5605 |
| 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 2007 ax-8 2110 ax-9 2118 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| 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 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ne 2933 df-ral 3052 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-br 5120 df-opab 5182 df-eprel 5553 df-so 5562 df-we 5608 |
| This theorem is referenced by: tz7.7 6378 |
| Copyright terms: Public domain | W3C validator |