| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rex2dom | 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 2815 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | prssi 3836 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → {𝑥, 𝑦} ⊆ 𝐴) | |
| 3 | df2o3 6640 | . . . . . . . 8 ⊢ 2o = {∅, 1o} | |
| 4 | 0ex 4221 | . . . . . . . . . 10 ⊢ ∅ ∈ V | |
| 5 | 4 | a1i 9 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → ∅ ∈ V) |
| 6 | 1oex 6633 | . . . . . . . . . 10 ⊢ 1o ∈ V | |
| 7 | 6 | a1i 9 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 1o ∈ V) |
| 8 | vex 2806 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
| 9 | 8 | a1i 9 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑥 ∈ V) |
| 10 | vex 2806 | . . . . . . . . . 10 ⊢ 𝑦 ∈ V | |
| 11 | 10 | a1i 9 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑦 ∈ V) |
| 12 | 1n0 6643 | . . . . . . . . . . 11 ⊢ 1o ≠ ∅ | |
| 13 | 12 | necomi 2488 | . . . . . . . . . 10 ⊢ ∅ ≠ 1o |
| 14 | 13 | a1i 9 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → ∅ ≠ 1o) |
| 15 | id 19 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑥 ≠ 𝑦) | |
| 16 | 5, 7, 9, 11, 14, 15 | en2prd 7035 | . . . . . . . 8 ⊢ (𝑥 ≠ 𝑦 → {∅, 1o} ≈ {𝑥, 𝑦}) |
| 17 | 3, 16 | eqbrtrid 4128 | . . . . . . 7 ⊢ (𝑥 ≠ 𝑦 → 2o ≈ {𝑥, 𝑦}) |
| 18 | endom 6979 | . . . . . . 7 ⊢ (2o ≈ {𝑥, 𝑦} → 2o ≼ {𝑥, 𝑦}) | |
| 19 | 17, 18 | syl 14 | . . . . . 6 ⊢ (𝑥 ≠ 𝑦 → 2o ≼ {𝑥, 𝑦}) |
| 20 | domssr 6994 | . . . . . . 7 ⊢ ((𝐴 ∈ V ∧ {𝑥, 𝑦} ⊆ 𝐴 ∧ 2o ≼ {𝑥, 𝑦}) → 2o ≼ 𝐴) | |
| 21 | 20 | 3expib 1233 | . . . . . 6 ⊢ (𝐴 ∈ V → (({𝑥, 𝑦} ⊆ 𝐴 ∧ 2o ≼ {𝑥, 𝑦}) → 2o ≼ 𝐴)) |
| 22 | 2, 19, 21 | syl2ani 408 | . . . . 5 ⊢ (𝐴 ∈ V → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≠ 𝑦) → 2o ≼ 𝐴)) |
| 23 | 22 | expd 258 | . . . 4 ⊢ (𝐴 ∈ V → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥 ≠ 𝑦 → 2o ≼ 𝐴))) |
| 24 | 23 | rexlimdvv 2658 | . . 3 ⊢ (𝐴 ∈ V → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 → 2o ≼ 𝐴)) |
| 25 | 1, 24 | syl 14 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 → 2o ≼ 𝐴)) |
| 26 | 25 | imp 124 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦) → 2o ≼ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2202 ≠ wne 2403 ∃wrex 2512 Vcvv 2803 ⊆ wss 3201 ∅c0 3496 {cpr 3674 class class class wbr 4093 1oc1o 6618 2oc2o 6619 ≈ cen 6950 ≼ cdom 6951 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-v 2805 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-suc 4474 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-1o 6625 df-2o 6626 df-en 6953 df-dom 6954 |
| This theorem is referenced by: hashdmprop2dom 11154 fun2dmnop0 11160 |
| Copyright terms: Public domain | W3C validator |