| 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 5616 | . 2 ⊢ ( E We 𝐴 → E Or 𝐴) | |
| 2 | solin 5560 | . . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 E 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 E 𝑥)) | |
| 3 | epel 5528 | . . . 4 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦) | |
| 4 | biid 262 | . . . 4 ⊢ (𝑥 = 𝑦 ↔ 𝑥 = 𝑦) | |
| 5 | epel 5528 | . . . 4 ⊢ (𝑦 E 𝑥 ↔ 𝑦 ∈ 𝑥) | |
| 6 | 3, 4, 5 | 3orbi123i 1162 | . . 3 ⊢ ((𝑥 E 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 E 𝑥) ↔ (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)) |
| 7 | 2, 6 | sylib 219 | . 2 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)) |
| 8 | 1, 7 | sylan 586 | 1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∨ w3o 1091 ∈ wcel 2119 class class class wbr 5079 E cep 5524 Or wor 5532 We wwe 5577 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ne 2936 df-ral 3055 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-br 5080 df-opab 5142 df-eprel 5525 df-so 5534 df-we 5580 |
| This theorem is referenced by: tz7.7 6343 |
| Copyright terms: Public domain | W3C validator |