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 3512 | . 2 ⊢ (𝐴 ∈ dom card → 𝐴 ∈ V) | |
2 | isnum2 9374 | . . . 4 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) | |
3 | rabn0 4339 | . . . 4 ⊢ ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) | |
4 | intex 5240 | . . . 4 ⊢ ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) | |
5 | 2, 3, 4 | 3bitr2i 301 | . . 3 ⊢ (𝐴 ∈ dom card ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) |
6 | 5 | biimpi 218 | . 2 ⊢ (𝐴 ∈ dom card → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) |
7 | breq2 5070 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴)) | |
8 | 7 | rabbidv 3480 | . . . 4 ⊢ (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
9 | 8 | inteqd 4881 | . . 3 ⊢ (𝑦 = 𝐴 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
10 | df-card 9368 | . . 3 ⊢ card = (𝑦 ∈ V ↦ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦}) | |
11 | 9, 10 | fvmptg 6766 | . 2 ⊢ ((𝐴 ∈ V ∧ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
12 | 1, 6, 11 | syl2anc 586 | 1 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∃wrex 3139 {crab 3142 Vcvv 3494 ∅c0 4291 ∩ cint 4876 class class class wbr 5066 dom cdm 5555 Oncon0 6191 ‘cfv 6355 ≈ cen 8506 cardccrd 9364 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-ord 6194 df-on 6195 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-fv 6363 df-en 8510 df-card 9368 |
This theorem is referenced by: cardid2 9382 oncardval 9384 cardidm 9388 cardne 9394 cardval 9968 |
Copyright terms: Public domain | W3C validator |