MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cardval3 Structured version   Visualization version   GIF version

Theorem cardval3 9867
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.)
Assertion
Ref Expression
cardval3 (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥𝐴})
Distinct variable group:   𝑥,𝐴

Proof of Theorem cardval3
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elex 3452 . 2 (𝐴 ∈ dom card → 𝐴 ∈ V)
2 isnum2 9860 . . . 4 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥𝐴)
3 rabn0 4317 . . . 4 ({𝑥 ∈ On ∣ 𝑥𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥𝐴)
4 intex 5272 . . . 4 ({𝑥 ∈ On ∣ 𝑥𝐴} ≠ ∅ ↔ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
52, 3, 43bitr2i 300 . . 3 (𝐴 ∈ dom card ↔ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
65biimpi 217 . 2 (𝐴 ∈ dom card → {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
7 breq2 5076 . . . . 5 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
87rabbidv 3398 . . . 4 (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥𝑦} = {𝑥 ∈ On ∣ 𝑥𝐴})
98inteqd 4882 . . 3 (𝑦 = 𝐴 {𝑥 ∈ On ∣ 𝑥𝑦} = {𝑥 ∈ On ∣ 𝑥𝐴})
10 df-card 9854 . . 3 card = (𝑦 ∈ V ↦ {𝑥 ∈ On ∣ 𝑥𝑦})
119, 10fvmptg 6933 . 2 ((𝐴 ∈ V ∧ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V) → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥𝐴})
121, 6, 11syl2anc 590 1 (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥𝐴})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  wne 2934  wrex 3063  {crab 3391  Vcvv 3431  c0 4261   cint 4877   class class class wbr 5072  dom cdm 5618  Oncon0 6310  cfv 6485  cen 8880  cardccrd 9850
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-ord 6313  df-on 6314  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fv 6493  df-en 8884  df-card 9854
This theorem is referenced by:  cardid2  9868  oncardval  9870  cardidm  9874  cardne  9880  cardval  10459
  Copyright terms: Public domain W3C validator