| 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 9877 | . . . . . . 7 ⊢ (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵) | |
| 2 | 1 | ensymd 8952 | . . . . . 6 ⊢ (𝐵 ∈ dom card → 𝐵 ≈ (card‘𝐵)) |
| 3 | sdomentr 9049 | . . . . . 6 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≈ (card‘𝐵)) → 𝐴 ≺ (card‘𝐵)) | |
| 4 | 2, 3 | sylan2 594 | . . . . 5 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ∈ dom card) → 𝐴 ≺ (card‘𝐵)) |
| 5 | ssdomg 8947 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → (card‘𝐵) ≼ 𝐴)) | |
| 6 | cardon 9868 | . . . . . . . . 9 ⊢ (card‘𝐵) ∈ On | |
| 7 | domtriord 9061 | . . . . . . . . 9 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) | |
| 8 | 6, 7 | mpan 691 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) |
| 9 | 5, 8 | sylibd 239 | . . . . . . 7 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → ¬ 𝐴 ≺ (card‘𝐵))) |
| 10 | 9 | con2d 134 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → ¬ (card‘𝐵) ⊆ 𝐴)) |
| 11 | ontri1 6358 | . . . . . . . 8 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) | |
| 12 | 6, 11 | mpan 691 | . . . . . . 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 9897 | . 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 2114 ⊆ wss 3890 class class class wbr 5086 dom cdm 5631 Oncon0 6324 ‘cfv 6499 ≈ cen 8890 ≼ cdom 8891 ≺ csdm 8892 cardccrd 9859 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6327 df-on 6328 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-card 9863 |
| This theorem is referenced by: iscard 9899 cardval2 9915 infxpenlem 9935 alephnbtwn 9993 alephnbtwn2 9994 alephord2 9998 alephsdom 10008 pwsdompw 10125 inaprc 10759 |
| Copyright terms: Public domain | W3C validator |