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 8763 | . . . . 5 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≈ 1o) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → {𝐴} ≈ 1o) |
4 | enpr2d.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝐷) | |
5 | 1on 8274 | . . . . 5 ⊢ 1o ∈ On | |
6 | en2sn 8785 | . . . . 5 ⊢ ((𝐵 ∈ 𝐷 ∧ 1o ∈ On) → {𝐵} ≈ {1o}) | |
7 | 4, 5, 6 | sylancl 585 | . . . 4 ⊢ (𝜑 → {𝐵} ≈ {1o}) |
8 | enpr2d.3 | . . . . . 6 ⊢ (𝜑 → ¬ 𝐴 = 𝐵) | |
9 | 8 | neqned 2949 | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
10 | disjsn2 4645 | . . . . 5 ⊢ (𝐴 ≠ 𝐵 → ({𝐴} ∩ {𝐵}) = ∅) | |
11 | 9, 10 | syl 17 | . . . 4 ⊢ (𝜑 → ({𝐴} ∩ {𝐵}) = ∅) |
12 | 5 | onirri 6358 | . . . . . 6 ⊢ ¬ 1o ∈ 1o |
13 | 12 | a1i 11 | . . . . 5 ⊢ (𝜑 → ¬ 1o ∈ 1o) |
14 | disjsn 4644 | . . . . 5 ⊢ ((1o ∩ {1o}) = ∅ ↔ ¬ 1o ∈ 1o) | |
15 | 13, 14 | sylibr 233 | . . . 4 ⊢ (𝜑 → (1o ∩ {1o}) = ∅) |
16 | unen 8790 | . . . 4 ⊢ ((({𝐴} ≈ 1o ∧ {𝐵} ≈ {1o}) ∧ (({𝐴} ∩ {𝐵}) = ∅ ∧ (1o ∩ {1o}) = ∅)) → ({𝐴} ∪ {𝐵}) ≈ (1o ∪ {1o})) | |
17 | 3, 7, 11, 15, 16 | syl22anc 835 | . . 3 ⊢ (𝜑 → ({𝐴} ∪ {𝐵}) ≈ (1o ∪ {1o})) |
18 | df-pr 4561 | . . 3 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
19 | df-suc 6257 | . . 3 ⊢ suc 1o = (1o ∪ {1o}) | |
20 | 17, 18, 19 | 3brtr4g 5104 | . 2 ⊢ (𝜑 → {𝐴, 𝐵} ≈ suc 1o) |
21 | df-2o 8268 | . 2 ⊢ 2o = suc 1o | |
22 | 20, 21 | breqtrrdi 5112 | 1 ⊢ (𝜑 → {𝐴, 𝐵} ≈ 2o) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∪ cun 3881 ∩ cin 3882 ∅c0 4253 {csn 4558 {cpr 4560 class class class wbr 5070 Oncon0 6251 suc csuc 6253 1oc1o 8260 2oc2o 8261 ≈ cen 8688 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-ord 6254 df-on 6255 df-suc 6257 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-1o 8267 df-2o 8268 df-en 8692 |
This theorem is referenced by: simpgnsgd 19618 2nsgsimpgd 19620 |
Copyright terms: Public domain | W3C validator |