Theorem isnum2 9835

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 9833	. . . 4 ⊢ card:{𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}⟶On
2	1	fdmi 6662	. . 3 ⊢ dom card = {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}
3	2	eleq2i 2823	. 2 ⊢ (𝐴 ∈ dom card ↔ 𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦})
4		relen 8874	. . . . 5 ⊢ Rel ≈
5	4	brrelex2i 5673	. . . 4 ⊢ (𝑥 ≈ 𝐴 → 𝐴 ∈ V)
6	5	rexlimivw 3129	. . 3 ⊢ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 → 𝐴 ∈ V)
7		breq2 5095	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴))
8	7	rexbidv 3156	. . 3 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ On 𝑥 ≈ 𝑦 ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴))
9	6, 8	elab3 3642	. 2 ⊢ (𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
10	3, 9	bitri 275	1 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)

Syntax hints:   ↔ wb 206   = wceq 1541   ∈ wcel 2111  {cab 2709  ∃wrex 3056  Vcvv 3436   class class class wbr 5091  dom cdm 5616  Oncon0 6306   ≈ cen 8866  cardccrd 9825

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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4898  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-ord 6309  df-on 6310  df-fun 6483  df-fn 6484  df-f 6485  df-en 8870  df-card 9829

This theorem is referenced by:  isnumi  9836  ennum  9837  xpnum  9841  cardval3  9842  dfac10c  10027  isfin7-2  10284  numth2  10359  inawinalem  10577