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

Theorem isnum2 9931
Description: A way to express well-orderability without bound or distinct variables. (Contributed by Stefan O'Rear, 28-Feb-2015.) (Revised by Mario Carneiro, 27-Apr-2015.)
Assertion
Ref Expression
isnum2 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem isnum2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cardf2 9929 . . . 4 card:{𝑦 ∣ ∃𝑥 ∈ On 𝑥𝑦}⟶On
21fdmi 6718 . . 3 dom card = {𝑦 ∣ ∃𝑥 ∈ On 𝑥𝑦}
32eleq2i 2861 . 2 (𝐴 ∈ dom card ↔ 𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥𝑦})
4 relen 8948 . . . . 5 Rel ≈
54brrelex2i 5719 . . . 4 (𝑥𝐴𝐴 ∈ V)
65rexlimivw 3168 . . 3 (∃𝑥 ∈ On 𝑥𝐴𝐴 ∈ V)
7 breq2 5115 . . . 4 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
87rexbidv 3195 . . 3 (𝑦 = 𝐴 → (∃𝑥 ∈ On 𝑥𝑦 ↔ ∃𝑥 ∈ On 𝑥𝐴))
96, 8elab3 3652 . 2 (𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥𝑦} ↔ ∃𝑥 ∈ On 𝑥𝐴)
103, 9bitri 278 1 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 209   = wceq 1567  wcel 2149  {cab 2747  wrex 3095  Vcvv 3461   class class class wbr 5111  dom cdm 5662  Oncon0 6361  cen 8940  cardccrd 9921
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5259  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3423  df-v 3463  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4915  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-ord 6364  df-on 6365  df-fun 6539  df-fn 6540  df-f 6541  df-en 8944  df-card 9925
This theorem is referenced by:  isnumi  9932  ennum  9933  xpnum  9937  cardval3  9938  dfac10c  10122  isfin7-2  10380  numth2  10455  inawinalem  10674
  Copyright terms: Public domain W3C validator