Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iscard4 Structured version   Visualization version   GIF version

Theorem iscard4 39949
Description: Two ways to express the property of being a cardinal number. (Contributed by RP, 8-Nov-2023.)
Assertion
Ref Expression
iscard4 ((card‘𝐴) = 𝐴𝐴 ∈ ran card)

Proof of Theorem iscard4
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqcom 2828 . 2 ((card‘𝐴) = 𝐴𝐴 = (card‘𝐴))
2 mptrel 5697 . . . . 5 Rel (𝑥 ∈ V ↦ {𝑦 ∈ On ∣ 𝑦𝑥})
3 df-card 9368 . . . . . 6 card = (𝑥 ∈ V ↦ {𝑦 ∈ On ∣ 𝑦𝑥})
43releqi 5652 . . . . 5 (Rel card ↔ Rel (𝑥 ∈ V ↦ {𝑦 ∈ On ∣ 𝑦𝑥}))
52, 4mpbir 233 . . . 4 Rel card
6 relelrnb 5817 . . . 4 (Rel card → (𝐴 ∈ ran card ↔ ∃𝑥 𝑥card𝐴))
75, 6ax-mp 5 . . 3 (𝐴 ∈ ran card ↔ ∃𝑥 𝑥card𝐴)
83funmpt2 6394 . . . . . . 7 Fun card
9 funbrfv 6716 . . . . . . 7 (Fun card → (𝑥card𝐴 → (card‘𝑥) = 𝐴))
108, 9ax-mp 5 . . . . . 6 (𝑥card𝐴 → (card‘𝑥) = 𝐴)
1110eqcomd 2827 . . . . 5 (𝑥card𝐴𝐴 = (card‘𝑥))
1211eximi 1835 . . . 4 (∃𝑥 𝑥card𝐴 → ∃𝑥 𝐴 = (card‘𝑥))
13 cardidm 9388 . . . . . . 7 (card‘(card‘𝑥)) = (card‘𝑥)
14 fveq2 6670 . . . . . . 7 (𝐴 = (card‘𝑥) → (card‘𝐴) = (card‘(card‘𝑥)))
15 id 22 . . . . . . 7 (𝐴 = (card‘𝑥) → 𝐴 = (card‘𝑥))
1613, 14, 153eqtr4a 2882 . . . . . 6 (𝐴 = (card‘𝑥) → (card‘𝐴) = 𝐴)
1716exlimiv 1931 . . . . 5 (∃𝑥 𝐴 = (card‘𝑥) → (card‘𝐴) = 𝐴)
181biimpi 218 . . . . . . . . . . 11 ((card‘𝐴) = 𝐴𝐴 = (card‘𝐴))
19 cardon 9373 . . . . . . . . . . 11 (card‘𝐴) ∈ On
2018, 19eqeltrdi 2921 . . . . . . . . . 10 ((card‘𝐴) = 𝐴𝐴 ∈ On)
21 onenon 9378 . . . . . . . . . 10 (𝐴 ∈ On → 𝐴 ∈ dom card)
2220, 21syl 17 . . . . . . . . 9 ((card‘𝐴) = 𝐴𝐴 ∈ dom card)
23 funfvbrb 6821 . . . . . . . . . 10 (Fun card → (𝐴 ∈ dom card ↔ 𝐴card(card‘𝐴)))
2423biimpd 231 . . . . . . . . 9 (Fun card → (𝐴 ∈ dom card → 𝐴card(card‘𝐴)))
258, 22, 24mpsyl 68 . . . . . . . 8 ((card‘𝐴) = 𝐴𝐴card(card‘𝐴))
26 id 22 . . . . . . . 8 ((card‘𝐴) = 𝐴 → (card‘𝐴) = 𝐴)
2725, 26breqtrd 5092 . . . . . . 7 ((card‘𝐴) = 𝐴𝐴card𝐴)
28 id 22 . . . . . . . . . 10 (𝐴 = (card‘𝐴) → 𝐴 = (card‘𝐴))
2928, 19eqeltrdi 2921 . . . . . . . . 9 (𝐴 = (card‘𝐴) → 𝐴 ∈ On)
3029eqcoms 2829 . . . . . . . 8 ((card‘𝐴) = 𝐴𝐴 ∈ On)
31 sbcbr1g 5123 . . . . . . . . 9 (𝐴 ∈ On → ([𝐴 / 𝑥]𝑥card𝐴𝐴 / 𝑥𝑥card𝐴))
32 csbvarg 4383 . . . . . . . . . 10 (𝐴 ∈ On → 𝐴 / 𝑥𝑥 = 𝐴)
3332breq1d 5076 . . . . . . . . 9 (𝐴 ∈ On → (𝐴 / 𝑥𝑥card𝐴𝐴card𝐴))
3431, 33bitrd 281 . . . . . . . 8 (𝐴 ∈ On → ([𝐴 / 𝑥]𝑥card𝐴𝐴card𝐴))
3530, 34syl 17 . . . . . . 7 ((card‘𝐴) = 𝐴 → ([𝐴 / 𝑥]𝑥card𝐴𝐴card𝐴))
3627, 35mpbird 259 . . . . . 6 ((card‘𝐴) = 𝐴[𝐴 / 𝑥]𝑥card𝐴)
3736spesbcd 3866 . . . . 5 ((card‘𝐴) = 𝐴 → ∃𝑥 𝑥card𝐴)
3817, 37syl 17 . . . 4 (∃𝑥 𝐴 = (card‘𝑥) → ∃𝑥 𝑥card𝐴)
3912, 38impbii 211 . . 3 (∃𝑥 𝑥card𝐴 ↔ ∃𝑥 𝐴 = (card‘𝑥))
40 oncard 9389 . . 3 (∃𝑥 𝐴 = (card‘𝑥) ↔ 𝐴 = (card‘𝐴))
417, 39, 403bitrri 300 . 2 (𝐴 = (card‘𝐴) ↔ 𝐴 ∈ ran card)
421, 41bitri 277 1 ((card‘𝐴) = 𝐴𝐴 ∈ ran card)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1537  wex 1780  wcel 2114  {crab 3142  Vcvv 3494  [wsbc 3772  csb 3883   cint 4876   class class class wbr 5066  cmpt 5146  dom cdm 5555  ran crn 5556  Rel wrel 5560  Oncon0 6191  Fun wfun 6349  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-pow 5266  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-fal 1550  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-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  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-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-er 8289  df-en 8510  df-card 9368
This theorem is referenced by:  elrncard  39951  alephiso2  39966
  Copyright terms: Public domain W3C validator