| 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 4661 | . . 3 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
| 2 | cardon 9837 | . . . . . 6 ⊢ (card‘𝐴) ∈ On | |
| 3 | 2 | onordi 6419 | . . . . 5 ⊢ Ord (card‘𝐴) |
| 4 | orddisj 6344 | . . . . 5 ⊢ (Ord (card‘𝐴) → ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅ |
| 6 | unsnen.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 7 | 6 | cardid 10438 | . . . . . 6 ⊢ (card‘𝐴) ≈ 𝐴 |
| 8 | 7 | ensymi 8926 | . . . . 5 ⊢ 𝐴 ≈ (card‘𝐴) |
| 9 | unsnen.2 | . . . . . 6 ⊢ 𝐵 ∈ V | |
| 10 | fvex 6835 | . . . . . 6 ⊢ (card‘𝐴) ∈ V | |
| 11 | en2sn 8963 | . . . . . 6 ⊢ ((𝐵 ∈ V ∧ (card‘𝐴) ∈ V) → {𝐵} ≈ {(card‘𝐴)}) | |
| 12 | 9, 10, 11 | mp2an 692 | . . . . 5 ⊢ {𝐵} ≈ {(card‘𝐴)} |
| 13 | unen 8967 | . . . . 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 6312 | . 2 ⊢ suc (card‘𝐴) = ((card‘𝐴) ∪ {(card‘𝐴)}) | |
| 18 | 16, 17 | breqtrrdi 5131 | 1 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ suc (card‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 Vcvv 3436 ∪ cun 3895 ∩ cin 3896 ∅c0 4280 {csn 4573 class class class wbr 5089 Ord word 6305 suc csuc 6308 ‘cfv 6481 ≈ cen 8866 cardccrd 9828 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-ac2 10354 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-se 5568 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-er 8622 df-en 8870 df-card 9832 df-ac 10007 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |