Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cardval3 | Structured version Visualization version GIF version |
Description: An alternate definition of the value of (card‘𝐴) that does not require AC to prove. (Contributed by Mario Carneiro, 7-Jan-2013.) (Revised by Mario Carneiro, 27-Apr-2015.) |
Ref | Expression |
---|---|
cardval3 | ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3212 | . 2 ⊢ (𝐴 ∈ dom card → 𝐴 ∈ V) | |
2 | isnum2 8771 | . . . 4 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) | |
3 | rabn0 3958 | . . . 4 ⊢ ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) | |
4 | intex 4820 | . . . 4 ⊢ ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) | |
5 | 2, 3, 4 | 3bitr2i 288 | . . 3 ⊢ (𝐴 ∈ dom card ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) |
6 | 5 | biimpi 206 | . 2 ⊢ (𝐴 ∈ dom card → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) |
7 | breq2 4657 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴)) | |
8 | 7 | rabbidv 3189 | . . . 4 ⊢ (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
9 | 8 | inteqd 4480 | . . 3 ⊢ (𝑦 = 𝐴 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
10 | df-card 8765 | . . 3 ⊢ card = (𝑦 ∈ V ↦ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦}) | |
11 | 9, 10 | fvmptg 6280 | . 2 ⊢ ((𝐴 ∈ V ∧ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
12 | 1, 6, 11 | syl2anc 693 | 1 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∃wrex 2913 {crab 2916 Vcvv 3200 ∅c0 3915 ∩ cint 4475 class class class wbr 4653 dom cdm 5114 Oncon0 5723 ‘cfv 5888 ≈ cen 7952 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-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-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-fv 5896 df-en 7956 df-card 8765 |
This theorem is referenced by: cardid2 8779 oncardval 8781 cardidm 8785 cardne 8791 cardval 9368 |
Copyright terms: Public domain | W3C validator |