| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unsnen | Structured version Visualization version GIF version | ||
| Description: Equinumerosity of a set with a new element added. (Contributed by NM, 7-Nov-2008.) |
| Ref | Expression |
|---|---|
| unsnen.1 | ⊢ 𝐴 ∈ V |
| unsnen.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| unsnen | ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ suc (card‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjsn 4671 | . . 3 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
| 2 | cardon 9873 | . . . . . 6 ⊢ (card‘𝐴) ∈ On | |
| 3 | 2 | onordi 6433 | . . . . 5 ⊢ Ord (card‘𝐴) |
| 4 | orddisj 6358 | . . . . 5 ⊢ (Ord (card‘𝐴) → ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅ |
| 6 | unsnen.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 7 | 6 | cardid 10476 | . . . . . 6 ⊢ (card‘𝐴) ≈ 𝐴 |
| 8 | 7 | ensymi 8952 | . . . . 5 ⊢ 𝐴 ≈ (card‘𝐴) |
| 9 | unsnen.2 | . . . . . 6 ⊢ 𝐵 ∈ V | |
| 10 | fvex 6853 | . . . . . 6 ⊢ (card‘𝐴) ∈ V | |
| 11 | en2sn 8989 | . . . . . 6 ⊢ ((𝐵 ∈ V ∧ (card‘𝐴) ∈ V) → {𝐵} ≈ {(card‘𝐴)}) | |
| 12 | 9, 10, 11 | mp2an 692 | . . . . 5 ⊢ {𝐵} ≈ {(card‘𝐴)} |
| 13 | unen 8994 | . . . . 5 ⊢ (((𝐴 ≈ (card‘𝐴) ∧ {𝐵} ≈ {(card‘𝐴)}) ∧ ((𝐴 ∩ {𝐵}) = ∅ ∧ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅)) → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) | |
| 14 | 8, 12, 13 | mpanl12 702 | . . . 4 ⊢ (((𝐴 ∩ {𝐵}) = ∅ ∧ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅) → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 15 | 5, 14 | mpan2 691 | . . 3 ⊢ ((𝐴 ∩ {𝐵}) = ∅ → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 16 | 1, 15 | sylbir 235 | . 2 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 17 | df-suc 6326 | . 2 ⊢ suc (card‘𝐴) = ((card‘𝐴) ∪ {(card‘𝐴)}) | |
| 18 | 16, 17 | breqtrrdi 5144 | 1 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ suc (card‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3444 ∪ cun 3909 ∩ cin 3910 ∅c0 4292 {csn 4585 class class class wbr 5102 Ord word 6319 suc csuc 6322 ‘cfv 6499 ≈ cen 8892 cardccrd 9864 |
| 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-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-ac2 10392 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7326 df-ov 7372 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-er 8648 df-en 8896 df-card 9868 df-ac 10045 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |