| 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 4670 | . . 3 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
| 2 | cardon 9868 | . . . . . 6 ⊢ (card‘𝐴) ∈ On | |
| 3 | 2 | onordi 6438 | . . . . 5 ⊢ Ord (card‘𝐴) |
| 4 | orddisj 6363 | . . . . 5 ⊢ (Ord (card‘𝐴) → ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅ |
| 6 | unsnen.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 7 | 6 | cardid 10469 | . . . . . 6 ⊢ (card‘𝐴) ≈ 𝐴 |
| 8 | 7 | ensymi 8953 | . . . . 5 ⊢ 𝐴 ≈ (card‘𝐴) |
| 9 | unsnen.2 | . . . . . 6 ⊢ 𝐵 ∈ V | |
| 10 | fvex 6855 | . . . . . 6 ⊢ (card‘𝐴) ∈ V | |
| 11 | en2sn 8990 | . . . . . 6 ⊢ ((𝐵 ∈ V ∧ (card‘𝐴) ∈ V) → {𝐵} ≈ {(card‘𝐴)}) | |
| 12 | 9, 10, 11 | mp2an 693 | . . . . 5 ⊢ {𝐵} ≈ {(card‘𝐴)} |
| 13 | unen 8994 | . . . . 5 ⊢ (((𝐴 ≈ (card‘𝐴) ∧ {𝐵} ≈ {(card‘𝐴)}) ∧ ((𝐴 ∩ {𝐵}) = ∅ ∧ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅)) → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) | |
| 14 | 8, 12, 13 | mpanl12 703 | . . . 4 ⊢ (((𝐴 ∩ {𝐵}) = ∅ ∧ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅) → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 15 | 5, 14 | mpan2 692 | . . 3 ⊢ ((𝐴 ∩ {𝐵}) = ∅ → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 16 | 1, 15 | sylbir 235 | . 2 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 17 | df-suc 6331 | . 2 ⊢ suc (card‘𝐴) = ((card‘𝐴) ∪ {(card‘𝐴)}) | |
| 18 | 16, 17 | breqtrrdi 5142 | 1 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ suc (card‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∪ cun 3901 ∩ cin 3902 ∅c0 4287 {csn 4582 class class class wbr 5100 Ord word 6324 suc csuc 6327 ‘cfv 6500 ≈ cen 8892 cardccrd 9859 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-ac2 10385 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-er 8645 df-en 8896 df-card 9863 df-ac 10038 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |