![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > carddom2 | Structured version Visualization version GIF version |
Description: Two numerable sets have the dominance relationship iff their cardinalities have the subset relationship. See also carddom 10597, which uses AC. (Contributed by Mario Carneiro, 11-Jan-2013.) (Revised by Mario Carneiro, 29-Apr-2015.) |
Ref | Expression |
---|---|
carddom2 | ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ 𝐴 ≼ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | carddomi2 10013 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴 ≼ 𝐵)) | |
2 | brdom2 9013 | . . 3 ⊢ (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) | |
3 | cardon 9987 | . . . . . . . 8 ⊢ (card‘𝐴) ∈ On | |
4 | 3 | onelssi 6491 | . . . . . . 7 ⊢ ((card‘𝐵) ∈ (card‘𝐴) → (card‘𝐵) ⊆ (card‘𝐴)) |
5 | carddomi2 10013 | . . . . . . . 8 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ dom card) → ((card‘𝐵) ⊆ (card‘𝐴) → 𝐵 ≼ 𝐴)) | |
6 | 5 | ancoms 457 | . . . . . . 7 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐵) ⊆ (card‘𝐴) → 𝐵 ≼ 𝐴)) |
7 | domnsym 9137 | . . . . . . 7 ⊢ (𝐵 ≼ 𝐴 → ¬ 𝐴 ≺ 𝐵) | |
8 | 4, 6, 7 | syl56 36 | . . . . . 6 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐵) ∈ (card‘𝐴) → ¬ 𝐴 ≺ 𝐵)) |
9 | 8 | con2d 134 | . . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≺ 𝐵 → ¬ (card‘𝐵) ∈ (card‘𝐴))) |
10 | cardon 9987 | . . . . . 6 ⊢ (card‘𝐵) ∈ On | |
11 | ontri1 6410 | . . . . . 6 ⊢ (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴))) | |
12 | 3, 10, 11 | mp2an 690 | . . . . 5 ⊢ ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴)) |
13 | 9, 12 | imbitrrdi 251 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≺ 𝐵 → (card‘𝐴) ⊆ (card‘𝐵))) |
14 | carden2b 10010 | . . . . . 6 ⊢ (𝐴 ≈ 𝐵 → (card‘𝐴) = (card‘𝐵)) | |
15 | eqimss 4038 | . . . . . 6 ⊢ ((card‘𝐴) = (card‘𝐵) → (card‘𝐴) ⊆ (card‘𝐵)) | |
16 | 14, 15 | syl 17 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → (card‘𝐴) ⊆ (card‘𝐵)) |
17 | 16 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≈ 𝐵 → (card‘𝐴) ⊆ (card‘𝐵))) |
18 | 13, 17 | jaod 857 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) → (card‘𝐴) ⊆ (card‘𝐵))) |
19 | 2, 18 | biimtrid 241 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≼ 𝐵 → (card‘𝐴) ⊆ (card‘𝐵))) |
20 | 1, 19 | impbid 211 | 1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ 𝐴 ≼ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 = wceq 1534 ∈ wcel 2099 ⊆ wss 3947 class class class wbr 5153 dom cdm 5682 Oncon0 6376 ‘cfv 6554 ≈ cen 8971 ≼ cdom 8972 ≺ csdm 8973 cardccrd 9978 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3464 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-int 4955 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-ord 6379 df-on 6380 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-er 8734 df-en 8975 df-dom 8976 df-sdom 8977 df-card 9982 |
This theorem is referenced by: carduni 10024 carden2 10030 cardsdom2 10031 domtri2 10032 infxpidm2 10060 cardaleph 10132 infenaleph 10134 alephinit 10138 ficardun2 10245 ficardun2OLD 10246 ackbij2 10286 cfflb 10302 fin1a2lem9 10451 carddom 10597 pwfseqlem5 10706 hashdom 14396 minregex2 43202 |
Copyright terms: Public domain | W3C validator |