Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cardsdom2 | Structured version Visualization version GIF version |
Description: A numerable set is strictly dominated by another iff their cardinalities are strictly ordered. (Contributed by Stefan O'Rear, 30-Oct-2014.) (Revised by Mario Carneiro, 29-Apr-2015.) |
Ref | Expression |
---|---|
cardsdom2 | ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ∈ (card‘𝐵) ↔ 𝐴 ≺ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | carddom2 8803 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ 𝐴 ≼ 𝐵)) | |
2 | carden2 8813 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) = (card‘𝐵) ↔ 𝐴 ≈ 𝐵)) | |
3 | 2 | necon3abid 2830 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ≠ (card‘𝐵) ↔ ¬ 𝐴 ≈ 𝐵)) |
4 | 1, 3 | anbi12d 747 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐴) ≠ (card‘𝐵)) ↔ (𝐴 ≼ 𝐵 ∧ ¬ 𝐴 ≈ 𝐵))) |
5 | cardon 8770 | . . 3 ⊢ (card‘𝐴) ∈ On | |
6 | cardon 8770 | . . 3 ⊢ (card‘𝐵) ∈ On | |
7 | onelpss 5764 | . . 3 ⊢ (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ∈ (card‘𝐵) ↔ ((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐴) ≠ (card‘𝐵)))) | |
8 | 5, 6, 7 | mp2an 708 | . 2 ⊢ ((card‘𝐴) ∈ (card‘𝐵) ↔ ((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐴) ≠ (card‘𝐵))) |
9 | brsdom 7978 | . 2 ⊢ (𝐴 ≺ 𝐵 ↔ (𝐴 ≼ 𝐵 ∧ ¬ 𝐴 ≈ 𝐵)) | |
10 | 4, 8, 9 | 3bitr4g 303 | 1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ∈ (card‘𝐵) ↔ 𝐴 ≺ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∈ wcel 1990 ≠ wne 2794 ⊆ wss 3574 class class class wbr 4653 dom cdm 5114 Oncon0 5723 ‘cfv 5888 ≈ cen 7952 ≼ cdom 7953 ≺ csdm 7954 cardccrd 8761 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-ord 5726 df-on 5727 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-card 8765 |
This theorem is referenced by: domtri2 8815 nnsdomel 8816 indcardi 8864 sdom2en01 9124 cardsdom 9377 smobeth 9408 hargch 9495 |
Copyright terms: Public domain | W3C validator |