| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cardne | Structured version Visualization version GIF version | ||
| Description: No member of a cardinal number of a set is equinumerous to the set. Proposition 10.6(2) of [TakeutiZaring] p. 85. (Contributed by Mario Carneiro, 9-Jan-2013.) |
| Ref | Expression |
|---|---|
| cardne | ⊢ (𝐴 ∈ (card‘𝐵) → ¬ 𝐴 ≈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfvdm 6866 | . 2 ⊢ (𝐴 ∈ (card‘𝐵) → 𝐵 ∈ dom card) | |
| 2 | cardon 9854 | . . . . . . . . . 10 ⊢ (card‘𝐵) ∈ On | |
| 3 | 2 | oneli 6430 | . . . . . . . . 9 ⊢ (𝐴 ∈ (card‘𝐵) → 𝐴 ∈ On) |
| 4 | breq1 5099 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝐵 ↔ 𝐴 ≈ 𝐵)) | |
| 5 | 4 | onintss 6367 | . . . . . . . . 9 ⊢ (𝐴 ∈ On → (𝐴 ≈ 𝐵 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 6 | 3, 5 | syl 17 | . . . . . . . 8 ⊢ (𝐴 ∈ (card‘𝐵) → (𝐴 ≈ 𝐵 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 7 | 6 | adantl 481 | . . . . . . 7 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴 ≈ 𝐵 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 8 | cardval3 9862 | . . . . . . . . 9 ⊢ (𝐵 ∈ dom card → (card‘𝐵) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵}) | |
| 9 | 8 | sseq1d 3963 | . . . . . . . 8 ⊢ (𝐵 ∈ dom card → ((card‘𝐵) ⊆ 𝐴 ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 10 | 9 | adantr 480 | . . . . . . 7 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → ((card‘𝐵) ⊆ 𝐴 ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 11 | 7, 10 | sylibrd 259 | . . . . . 6 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴 ≈ 𝐵 → (card‘𝐵) ⊆ 𝐴)) |
| 12 | ontri1 6349 | . . . . . . . 8 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) | |
| 13 | 2, 3, 12 | sylancr 587 | . . . . . . 7 ⊢ (𝐴 ∈ (card‘𝐵) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) |
| 14 | 13 | adantl 481 | . . . . . 6 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) |
| 15 | 11, 14 | sylibd 239 | . . . . 5 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴 ≈ 𝐵 → ¬ 𝐴 ∈ (card‘𝐵))) |
| 16 | 15 | con2d 134 | . . . 4 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴 ∈ (card‘𝐵) → ¬ 𝐴 ≈ 𝐵)) |
| 17 | 16 | ex 412 | . . 3 ⊢ (𝐵 ∈ dom card → (𝐴 ∈ (card‘𝐵) → (𝐴 ∈ (card‘𝐵) → ¬ 𝐴 ≈ 𝐵))) |
| 18 | 17 | pm2.43d 53 | . 2 ⊢ (𝐵 ∈ dom card → (𝐴 ∈ (card‘𝐵) → ¬ 𝐴 ≈ 𝐵)) |
| 19 | 1, 18 | mpcom 38 | 1 ⊢ (𝐴 ∈ (card‘𝐵) → ¬ 𝐴 ≈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2113 {crab 3397 ⊆ wss 3899 ∩ cint 4900 class class class wbr 5096 dom cdm 5622 Oncon0 6315 ‘cfv 6490 ≈ cen 8878 cardccrd 9845 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| 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 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-ord 6318 df-on 6319 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-fv 6498 df-en 8882 df-card 9849 |
| This theorem is referenced by: carden2b 9877 cardlim 9882 cardsdomelir 9883 |
| Copyright terms: Public domain | W3C validator |