| 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 9913 | . . . . . . 7 ⊢ (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵) | |
| 2 | 1 | ensymd 8979 | . . . . . 6 ⊢ (𝐵 ∈ dom card → 𝐵 ≈ (card‘𝐵)) |
| 3 | sdomentr 9081 | . . . . . 6 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≈ (card‘𝐵)) → 𝐴 ≺ (card‘𝐵)) | |
| 4 | 2, 3 | sylan2 593 | . . . . 5 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ∈ dom card) → 𝐴 ≺ (card‘𝐵)) |
| 5 | ssdomg 8974 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → (card‘𝐵) ≼ 𝐴)) | |
| 6 | cardon 9904 | . . . . . . . . 9 ⊢ (card‘𝐵) ∈ On | |
| 7 | domtriord 9093 | . . . . . . . . 9 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) | |
| 8 | 6, 7 | mpan 690 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) |
| 9 | 5, 8 | sylibd 239 | . . . . . . 7 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → ¬ 𝐴 ≺ (card‘𝐵))) |
| 10 | 9 | con2d 134 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → ¬ (card‘𝐵) ⊆ 𝐴)) |
| 11 | ontri1 6369 | . . . . . . . 8 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) | |
| 12 | 6, 11 | mpan 690 | . . . . . . 7 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) |
| 13 | 12 | con2bid 354 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ∈ (card‘𝐵) ↔ ¬ (card‘𝐵) ⊆ 𝐴)) |
| 14 | 10, 13 | sylibrd 259 | . . . . 5 ⊢ (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → 𝐴 ∈ (card‘𝐵))) |
| 15 | 4, 14 | syl5 34 | . . . 4 ⊢ (𝐴 ∈ On → ((𝐴 ≺ 𝐵 ∧ 𝐵 ∈ dom card) → 𝐴 ∈ (card‘𝐵))) |
| 16 | 15 | expcomd 416 | . . 3 ⊢ (𝐴 ∈ On → (𝐵 ∈ dom card → (𝐴 ≺ 𝐵 → 𝐴 ∈ (card‘𝐵)))) |
| 17 | 16 | imp 406 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴 ≺ 𝐵 → 𝐴 ∈ (card‘𝐵))) |
| 18 | cardsdomelir 9933 | . 2 ⊢ (𝐴 ∈ (card‘𝐵) → 𝐴 ≺ 𝐵) | |
| 19 | 17, 18 | impbid1 225 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴 ≺ 𝐵 ↔ 𝐴 ∈ (card‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2109 ⊆ wss 3917 class class class wbr 5110 dom cdm 5641 Oncon0 6335 ‘cfv 6514 ≈ cen 8918 ≼ cdom 8919 ≺ csdm 8920 cardccrd 9895 |
| 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 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| 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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-ord 6338 df-on 6339 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-card 9899 |
| This theorem is referenced by: iscard 9935 cardval2 9951 infxpenlem 9973 alephnbtwn 10031 alephnbtwn2 10032 alephord2 10036 alephsdom 10046 pwsdompw 10163 inaprc 10796 |
| Copyright terms: Public domain | W3C validator |