| 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 4679 | . . 3 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
| 2 | cardon 9946 | . . . . . 6 ⊢ (card‘𝐴) ∈ On | |
| 3 | 2 | onordi 6478 | . . . . 5 ⊢ Ord (card‘𝐴) |
| 4 | orddisj 6403 | . . . . 5 ⊢ (Ord (card‘𝐴) → ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅ |
| 6 | unsnen.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 7 | 6 | cardid 10548 | . . . . . 6 ⊢ (card‘𝐴) ≈ 𝐴 |
| 8 | 7 | ensymi 9007 | . . . . 5 ⊢ 𝐴 ≈ (card‘𝐴) |
| 9 | unsnen.2 | . . . . . 6 ⊢ 𝐵 ∈ V | |
| 10 | fvex 6898 | . . . . . 6 ⊢ (card‘𝐴) ∈ V | |
| 11 | en2sn 9045 | . . . . . 6 ⊢ ((𝐵 ∈ V ∧ (card‘𝐴) ∈ V) → {𝐵} ≈ {(card‘𝐴)}) | |
| 12 | 9, 10, 11 | mp2an 705 | . . . . 5 ⊢ {𝐵} ≈ {(card‘𝐴)} |
| 13 | unen 9049 | . . . . 5 ⊢ (((𝐴 ≈ (card‘𝐴) ∧ {𝐵} ≈ {(card‘𝐴)}) ∧ ((𝐴 ∩ {𝐵}) = ∅ ∧ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅)) → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) | |
| 14 | 8, 12, 13 | mpanl12 715 | . . . 4 ⊢ (((𝐴 ∩ {𝐵}) = ∅ ∧ ((card‘𝐴) ∩ {(card‘𝐴)}) = ∅) → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 15 | 5, 14 | mpan2 704 | . . 3 ⊢ ((𝐴 ∩ {𝐵}) = ∅ → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 16 | 1, 15 | sylbir 238 | . 2 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ ((card‘𝐴) ∪ {(card‘𝐴)})) |
| 17 | df-suc 6370 | . 2 ⊢ suc (card‘𝐴) = ((card‘𝐴) ∪ {(card‘𝐴)}) | |
| 18 | 16, 17 | breqtrrdi 5155 | 1 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∪ {𝐵}) ≈ suc (card‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ∪ cun 3904 ∩ cin 3905 ∅c0 4286 {csn 4591 class class class wbr 5111 Ord word 6363 suc csuc 6366 ‘cfv 6540 ≈ cen 8946 cardccrd 9937 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-ac2 10462 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-er 8700 df-en 8950 df-card 9941 df-ac 10116 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |