| 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 6918 | . 2 ⊢ (𝐴 ∈ (card‘𝐵) → 𝐵 ∈ dom card) | |
| 2 | cardon 9963 | . . . . . . . . . 10 ⊢ (card‘𝐵) ∈ On | |
| 3 | 2 | oneli 6473 | . . . . . . . . 9 ⊢ (𝐴 ∈ (card‘𝐵) → 𝐴 ∈ On) |
| 4 | breq1 5127 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝐵 ↔ 𝐴 ≈ 𝐵)) | |
| 5 | 4 | onintss 6409 | . . . . . . . . 9 ⊢ (𝐴 ∈ On → (𝐴 ≈ 𝐵 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 6 | 3, 5 | syl 17 | . . . . . . . 8 ⊢ (𝐴 ∈ (card‘𝐵) → (𝐴 ≈ 𝐵 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 7 | 6 | adantl 481 | . . . . . . 7 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴 ≈ 𝐵 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵} ⊆ 𝐴)) |
| 8 | cardval3 9971 | . . . . . . . . 9 ⊢ (𝐵 ∈ dom card → (card‘𝐵) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐵}) | |
| 9 | 8 | sseq1d 3995 | . . . . . . . 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 6391 | . . . . . . . 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 2109 {crab 3420 ⊆ wss 3931 ∩ cint 4927 class class class wbr 5124 dom cdm 5659 Oncon0 6357 ‘cfv 6536 ≈ cen 8961 cardccrd 9954 |
| 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 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 |
| 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 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-int 4928 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-ord 6360 df-on 6361 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-en 8965 df-card 9958 |
| This theorem is referenced by: carden2b 9986 cardlim 9991 cardsdomelir 9992 |
| Copyright terms: Public domain | W3C validator |