| 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 9897 | . . . . . . 7 ⊢ (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵) | |
| 2 | 1 | ensymd 8971 | . . . . . 6 ⊢ (𝐵 ∈ dom card → 𝐵 ≈ (card‘𝐵)) |
| 3 | sdomentr 9068 | . . . . . 6 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≈ (card‘𝐵)) → 𝐴 ≺ (card‘𝐵)) | |
| 4 | 2, 3 | sylan2 601 | . . . . 5 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ∈ dom card) → 𝐴 ≺ (card‘𝐵)) |
| 5 | ssdomg 8966 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → (card‘𝐵) ≼ 𝐴)) | |
| 6 | cardon 9888 | . . . . . . . . 9 ⊢ (card‘𝐵) ∈ On | |
| 7 | domtriord 9080 | . . . . . . . . 9 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) | |
| 8 | 6, 7 | mpan 698 | . . . . . . . 8 ⊢ (𝐴 ∈ On → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵))) |
| 9 | 5, 8 | sylibd 241 | . . . . . . 7 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → ¬ 𝐴 ≺ (card‘𝐵))) |
| 10 | 9 | con2d 134 | . . . . . 6 ⊢ (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → ¬ (card‘𝐵) ⊆ 𝐴)) |
| 11 | ontri1 6365 | . . . . . . . 8 ⊢ (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) | |
| 12 | 6, 11 | mpan 698 | . . . . . . 7 ⊢ (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵))) |
| 13 | 12 | con2bid 356 | . . . . . 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 9917 | . 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 2132 ⊆ wss 3895 class class class wbr 5090 dom cdm 5636 Oncon0 6331 ‘cfv 6506 ≈ cen 8909 ≼ cdom 8910 ≺ csdm 8911 cardccrd 9879 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-ral 3067 df-rex 3077 df-rab 3405 df-v 3446 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-ord 6334 df-on 6335 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-card 9883 |
| This theorem is referenced by: iscard 9919 cardval2 9935 infxpenlem 9955 alephnbtwn 10013 alephnbtwn2 10014 alephord2 10018 alephsdom 10028 pwsdompw 10145 inaprc 10780 |
| Copyright terms: Public domain | W3C validator |