Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cardsdomel | Structured version Visualization version GIF version |
Description: A cardinal strictly dominates its members. Equivalent to Proposition 10.37 of [TakeutiZaring] p. 93. (Contributed by Mario Carneiro, 15-Jan-2013.) (Revised by Mario Carneiro, 4-Jun-2015.) |
Ref | Expression |
---|---|
cardsdomel | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴 ≺ 𝐵 ↔ 𝐴 ∈ (card‘𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cardid2 9384 | . . . . . . 7 ⊢ (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵) | |
2 | 1 | ensymd 8562 | . . . . . 6 ⊢ (𝐵 ∈ dom card → 𝐵 ≈ (card‘𝐵)) |
3 | sdomentr 8653 | . . . . . 6 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≈ (card‘𝐵)) → 𝐴 ≺ (card‘𝐵)) | |
4 | 2, 3 | sylan2 594 | . . . . 5 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ∈ dom card) → 𝐴 ≺ (card‘𝐵)) |
5 | ssdomg 8557 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → (card‘𝐵) ≼ 𝐴)) | |
6 | cardon 9375 | . . . . . . . . 9 ⊢ (card‘𝐵) ∈ On | |
7 | domtriord 8665 | . . . . . . . . 9 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) | |
8 | 6, 7 | mpan 688 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) |
9 | 5, 8 | sylibd 241 | . . . . . . 7 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → ¬ 𝐴 ≺ (card‘𝐵))) |
10 | 9 | con2d 136 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → ¬ (card‘𝐵) ⊆ 𝐴)) |
11 | ontri1 6227 | . . . . . . . 8 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) | |
12 | 6, 11 | mpan 688 | . . . . . . 7 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) |
13 | 12 | con2bid 357 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ∈ (card‘𝐵) ↔ ¬ (card‘𝐵) ⊆ 𝐴)) |
14 | 10, 13 | sylibrd 261 | . . . . 5 ⊢ (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → 𝐴 ∈ (card‘𝐵))) |
15 | 4, 14 | syl5 34 | . . . 4 ⊢ (𝐴 ∈ On → ((𝐴 ≺ 𝐵 ∧ 𝐵 ∈ dom card) → 𝐴 ∈ (card‘𝐵))) |
16 | 15 | expcomd 419 | . . 3 ⊢ (𝐴 ∈ On → (𝐵 ∈ dom card → (𝐴 ≺ 𝐵 → 𝐴 ∈ (card‘𝐵)))) |
17 | 16 | imp 409 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴 ≺ 𝐵 → 𝐴 ∈ (card‘𝐵))) |
18 | cardsdomelir 9404 | . 2 ⊢ (𝐴 ∈ (card‘𝐵) → 𝐴 ≺ 𝐵) | |
19 | 17, 18 | impbid1 227 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴 ≺ 𝐵 ↔ 𝐴 ∈ (card‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2114 ⊆ wss 3938 class class class wbr 5068 dom cdm 5557 Oncon0 6193 ‘cfv 6357 ≈ cen 8508 ≼ cdom 8509 ≺ csdm 8510 cardccrd 9366 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-ord 6196 df-on 6197 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-card 9370 |
This theorem is referenced by: iscard 9406 cardval2 9422 infxpenlem 9441 alephnbtwn 9499 alephnbtwn2 9500 alephord2 9504 alephsdom 9514 pwsdompw 9628 inaprc 10260 |
Copyright terms: Public domain | W3C validator |