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

Theorem cardval3 10021
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 3509 . 2 (𝐴 ∈ dom card → 𝐴 ∈ V)
2 isnum2 10014 . . . 4 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥𝐴)
3 rabn0 4412 . . . 4 ({𝑥 ∈ On ∣ 𝑥𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥𝐴)
4 intex 5362 . . . 4 ({𝑥 ∈ On ∣ 𝑥𝐴} ≠ ∅ ↔ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
52, 3, 43bitr2i 299 . . 3 (𝐴 ∈ dom card ↔ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
65biimpi 216 . 2 (𝐴 ∈ dom card → {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
7 breq2 5170 . . . . 5 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
87rabbidv 3451 . . . 4 (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥𝑦} = {𝑥 ∈ On ∣ 𝑥𝐴})
98inteqd 4975 . . 3 (𝑦 = 𝐴 {𝑥 ∈ On ∣ 𝑥𝑦} = {𝑥 ∈ On ∣ 𝑥𝐴})
10 df-card 10008 . . 3 card = (𝑦 ∈ V ↦ {𝑥 ∈ On ∣ 𝑥𝑦})
119, 10fvmptg 7027 . 2 ((𝐴 ∈ V ∧ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V) → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥𝐴})
121, 6, 11syl2anc 583 1 (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥𝐴})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2108  wne 2946  wrex 3076  {crab 3443  Vcvv 3488  c0 4352   cint 4970   class class class wbr 5166  dom cdm 5700  Oncon0 6395  cfv 6573  cen 9000  cardccrd 10004
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-en 9004  df-card 10008
This theorem is referenced by:  cardid2  10022  oncardval  10024  cardidm  10028  cardne  10034  cardval  10615
  Copyright terms: Public domain W3C validator