| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rex2dom | Structured version Visualization version GIF version | ||
| Description: A set that has at least 2 different members dominates ordinal 2. (Contributed by BTernaryTau, 30-Dec-2024.) |
| Ref | Expression |
|---|---|
| rex2dom | ⊢ ((𝐴 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦) → 2o ≼ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3471 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | prssi 4788 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → {𝑥, 𝑦} ⊆ 𝐴) | |
| 3 | df2o3 8445 | . . . . . . . 8 ⊢ 2o = {∅, 1o} | |
| 4 | 0ex 5265 | . . . . . . . . . 10 ⊢ ∅ ∈ V | |
| 5 | 4 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → ∅ ∈ V) |
| 6 | 1oex 8447 | . . . . . . . . . 10 ⊢ 1o ∈ V | |
| 7 | 6 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 1o ∈ V) |
| 8 | vex 3454 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
| 9 | 8 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑥 ∈ V) |
| 10 | vex 3454 | . . . . . . . . . 10 ⊢ 𝑦 ∈ V | |
| 11 | 10 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑦 ∈ V) |
| 12 | 1n0 8455 | . . . . . . . . . . 11 ⊢ 1o ≠ ∅ | |
| 13 | 12 | necomi 2980 | . . . . . . . . . 10 ⊢ ∅ ≠ 1o |
| 14 | 13 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → ∅ ≠ 1o) |
| 15 | id 22 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑥 ≠ 𝑦) | |
| 16 | 5, 7, 9, 11, 14, 15 | en2prd 9022 | . . . . . . . 8 ⊢ (𝑥 ≠ 𝑦 → {∅, 1o} ≈ {𝑥, 𝑦}) |
| 17 | 3, 16 | eqbrtrid 5145 | . . . . . . 7 ⊢ (𝑥 ≠ 𝑦 → 2o ≈ {𝑥, 𝑦}) |
| 18 | endom 8953 | . . . . . . 7 ⊢ (2o ≈ {𝑥, 𝑦} → 2o ≼ {𝑥, 𝑦}) | |
| 19 | 17, 18 | syl 17 | . . . . . 6 ⊢ (𝑥 ≠ 𝑦 → 2o ≼ {𝑥, 𝑦}) |
| 20 | domssr 8973 | . . . . . . 7 ⊢ ((𝐴 ∈ V ∧ {𝑥, 𝑦} ⊆ 𝐴 ∧ 2o ≼ {𝑥, 𝑦}) → 2o ≼ 𝐴) | |
| 21 | 20 | 3expib 1122 | . . . . . 6 ⊢ (𝐴 ∈ V → (({𝑥, 𝑦} ⊆ 𝐴 ∧ 2o ≼ {𝑥, 𝑦}) → 2o ≼ 𝐴)) |
| 22 | 2, 19, 21 | syl2ani 607 | . . . . 5 ⊢ (𝐴 ∈ V → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≠ 𝑦) → 2o ≼ 𝐴)) |
| 23 | 22 | expd 415 | . . . 4 ⊢ (𝐴 ∈ V → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥 ≠ 𝑦 → 2o ≼ 𝐴))) |
| 24 | 23 | rexlimdvv 3194 | . . 3 ⊢ (𝐴 ∈ V → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 → 2o ≼ 𝐴)) |
| 25 | 1, 24 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 → 2o ≼ 𝐴)) |
| 26 | 25 | imp 406 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦) → 2o ≼ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2109 ≠ wne 2926 ∃wrex 3054 Vcvv 3450 ⊆ wss 3917 ∅c0 4299 {cpr 4594 class class class wbr 5110 1oc1o 8430 2oc2o 8431 ≈ cen 8918 ≼ cdom 8919 |
| 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-10 2142 ax-12 2178 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-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 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-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-suc 6341 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-1o 8437 df-2o 8438 df-en 8922 df-dom 8923 |
| This theorem is referenced by: 1sdom2dom 9201 1sdom 9202 |
| Copyright terms: Public domain | W3C validator |