Theorem isnum2 9687

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.

Step	Hyp	Ref	Expression
1		cardf2 9685	. . . 4 ⊢ card:{𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}⟶On
2	1	fdmi 6608	. . 3 ⊢ dom card = {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}
3	2	eleq2i 2831	. 2 ⊢ (𝐴 ∈ dom card ↔ 𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦})
4		relen 8712	. . . . 5 ⊢ Rel ≈
5	4	brrelex2i 5643	. . . 4 ⊢ (𝑥 ≈ 𝐴 → 𝐴 ∈ V)
6	5	rexlimivw 3212	. . 3 ⊢ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 → 𝐴 ∈ V)
7		breq2 5082	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴))
8	7	rexbidv 3227	. . 3 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ On 𝑥 ≈ 𝑦 ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴))
9	6, 8	elab3 3618	. 2 ⊢ (𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
10	3, 9	bitri 274	1 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)

Syntax hints:   ↔ wb 205   = wceq 1541   ∈ wcel 2109  {cab 2716  ∃wrex 3066  Vcvv 3430   class class class wbr 5078  dom cdm 5588  Oncon0 6263   ≈ cen 8704  cardccrd 9677

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pr 5355  ax-un 7579

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3432  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-pss 3910  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4845  df-int 4885  df-br 5079  df-opab 5141  df-mpt 5162  df-tr 5196  df-id 5488  df-eprel 5494  df-po 5502  df-so 5503  df-fr 5543  df-we 5545  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-ord 6266  df-on 6267  df-fun 6432  df-fn 6433  df-f 6434  df-en 8708  df-card 9681

This theorem is referenced by:  isnumi  9688  ennum  9689  xpnum  9693  cardval3  9694  dfac10c  9878  isfin7-2  10136  numth2  10211  inawinalem  10429