![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > enpr2d | Structured version Visualization version GIF version |
Description: A pair with distinct elements is equinumerous to ordinal two. (Contributed by Rohan Ridenour, 3-Aug-2023.) |
Ref | Expression |
---|---|
enpr2d.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
enpr2d.2 | ⊢ (𝜑 → 𝐵 ∈ 𝐷) |
enpr2d.3 | ⊢ (𝜑 → ¬ 𝐴 = 𝐵) |
Ref | Expression |
---|---|
enpr2d | ⊢ (𝜑 → {𝐴, 𝐵} ≈ 2o) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | enpr2d.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝐶) | |
2 | ensn1g 8557 | . . . . 5 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≈ 1o) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → {𝐴} ≈ 1o) |
4 | enpr2d.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝐷) | |
5 | 1on 8092 | . . . . 5 ⊢ 1o ∈ On | |
6 | en2sn 8576 | . . . . 5 ⊢ ((𝐵 ∈ 𝐷 ∧ 1o ∈ On) → {𝐵} ≈ {1o}) | |
7 | 4, 5, 6 | sylancl 589 | . . . 4 ⊢ (𝜑 → {𝐵} ≈ {1o}) |
8 | enpr2d.3 | . . . . . 6 ⊢ (𝜑 → ¬ 𝐴 = 𝐵) | |
9 | 8 | neqned 2994 | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
10 | disjsn2 4608 | . . . . 5 ⊢ (𝐴 ≠ 𝐵 → ({𝐴} ∩ {𝐵}) = ∅) | |
11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝜑 → ({𝐴} ∩ {𝐵}) = ∅) |
12 | 5 | onirri 6265 | . . . . . 6 ⊢ ¬ 1o ∈ 1o |
13 | 12 | a1i 11 | . . . . 5 ⊢ (𝜑 → ¬ 1o ∈ 1o) |
14 | disjsn 4607 | . . . . 5 ⊢ ((1o ∩ {1o}) = ∅ ↔ ¬ 1o ∈ 1o) | |
15 | 13, 14 | sylibr 237 | . . . 4 ⊢ (𝜑 → (1o ∩ {1o}) = ∅) |
16 | unen 8579 | . . . 4 ⊢ ((({𝐴} ≈ 1o ∧ {𝐵} ≈ {1o}) ∧ (({𝐴} ∩ {𝐵}) = ∅ ∧ (1o ∩ {1o}) = ∅)) → ({𝐴} ∪ {𝐵}) ≈ (1o ∪ {1o})) | |
17 | 3, 7, 11, 15, 16 | syl22anc 837 | . . 3 ⊢ (𝜑 → ({𝐴} ∪ {𝐵}) ≈ (1o ∪ {1o})) |
18 | df-pr 4528 | . . 3 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
19 | df-suc 6165 | . . 3 ⊢ suc 1o = (1o ∪ {1o}) | |
20 | 17, 18, 19 | 3brtr4g 5064 | . 2 ⊢ (𝜑 → {𝐴, 𝐵} ≈ suc 1o) |
21 | df-2o 8086 | . 2 ⊢ 2o = suc 1o | |
22 | 20, 21 | breqtrrdi 5072 | 1 ⊢ (𝜑 → {𝐴, 𝐵} ≈ 2o) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∪ cun 3879 ∩ cin 3880 ∅c0 4243 {csn 4525 {cpr 4527 class class class wbr 5030 Oncon0 6159 suc csuc 6161 1oc1o 8078 2oc2o 8079 ≈ cen 8489 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-ord 6162 df-on 6163 df-suc 6165 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-1o 8085 df-2o 8086 df-er 8272 df-en 8493 |
This theorem is referenced by: simpgnsgd 19215 2nsgsimpgd 19217 |
Copyright terms: Public domain | W3C validator |