| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > enpr2d | 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 7036 | . . . . 5 ⊢ (𝐴 ∈ 𝐶 → {𝐴} ≈ 1o) | |
| 3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝜑 → {𝐴} ≈ 1o) |
| 4 | enpr2d.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝐷) | |
| 5 | 1on 6653 | . . . . 5 ⊢ 1o ∈ On | |
| 6 | en2sn 7054 | . . . . 5 ⊢ ((𝐵 ∈ 𝐷 ∧ 1o ∈ On) → {𝐵} ≈ {1o}) | |
| 7 | 4, 5, 6 | sylancl 413 | . . . 4 ⊢ (𝜑 → {𝐵} ≈ {1o}) |
| 8 | enpr2d.3 | . . . . . 6 ⊢ (𝜑 → ¬ 𝐴 = 𝐵) | |
| 9 | 8 | neqned 2419 | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| 10 | disjsn2 3751 | . . . . 5 ⊢ (𝐴 ≠ 𝐵 → ({𝐴} ∩ {𝐵}) = ∅) | |
| 11 | 9, 10 | syl 14 | . . . 4 ⊢ (𝜑 → ({𝐴} ∩ {𝐵}) = ∅) |
| 12 | 5 | onirri 4664 | . . . . . 6 ⊢ ¬ 1o ∈ 1o |
| 13 | 12 | a1i 9 | . . . . 5 ⊢ (𝜑 → ¬ 1o ∈ 1o) |
| 14 | disjsn 3750 | . . . . 5 ⊢ ((1o ∩ {1o}) = ∅ ↔ ¬ 1o ∈ 1o) | |
| 15 | 13, 14 | sylibr 134 | . . . 4 ⊢ (𝜑 → (1o ∩ {1o}) = ∅) |
| 16 | unen 7057 | . . . 4 ⊢ ((({𝐴} ≈ 1o ∧ {𝐵} ≈ {1o}) ∧ (({𝐴} ∩ {𝐵}) = ∅ ∧ (1o ∩ {1o}) = ∅)) → ({𝐴} ∪ {𝐵}) ≈ (1o ∪ {1o})) | |
| 17 | 3, 7, 11, 15, 16 | syl22anc 1275 | . . 3 ⊢ (𝜑 → ({𝐴} ∪ {𝐵}) ≈ (1o ∪ {1o})) |
| 18 | df-pr 3695 | . . 3 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 19 | df-suc 4491 | . . 3 ⊢ suc 1o = (1o ∪ {1o}) | |
| 20 | 17, 18, 19 | 3brtr4g 4142 | . 2 ⊢ (𝜑 → {𝐴, 𝐵} ≈ suc 1o) |
| 21 | df-2o 6647 | . 2 ⊢ 2o = suc 1o | |
| 22 | 20, 21 | breqtrrdi 4150 | 1 ⊢ (𝜑 → {𝐴, 𝐵} ≈ 2o) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1398 ∈ wcel 2203 ≠ wne 2412 ∪ cun 3208 ∩ cin 3209 ∅c0 3507 {csn 3688 {cpr 3689 class class class wbr 4108 Oncon0 4483 suc csuc 4485 1oc1o 6639 2oc2o 6640 ≈ cen 6972 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-v 2814 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-br 4109 df-opab 4171 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-suc 4491 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-1o 6646 df-2o 6647 df-er 6766 df-en 6975 |
| This theorem is referenced by: isnzr2 14318 |
| Copyright terms: Public domain | W3C validator |