Theorem en1 8998

Description: A set is equinumerous to ordinal one iff it is a singleton. (Contributed by NM, 25-Jul-2004.) Avoid ax-un 7714. (Revised by BTernaryTau, 23-Sep-2024.)

Assertion

Ref	Expression
en1	⊢ (𝐴 ≈ 1o ↔ ∃𝑥 𝐴 = {𝑥})

Distinct variable group:   𝑥,𝐴

Proof of Theorem en1

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df1o2 8444	. . . . 5 ⊢ 1o = {∅}
2	1	breq2i 5118	. . . 4 ⊢ (𝐴 ≈ 1o ↔ 𝐴 ≈ {∅})
3		encv 8929	. . . . . 6 ⊢ (𝐴 ≈ {∅} → (𝐴 ∈ V ∧ {∅} ∈ V))
4		breng 8930	. . . . . 6 ⊢ ((𝐴 ∈ V ∧ {∅} ∈ V) → (𝐴 ≈ {∅} ↔ ∃𝑓 𝑓:𝐴–1-1-onto→{∅}))
5	3, 4	syl 17	. . . . 5 ⊢ (𝐴 ≈ {∅} → (𝐴 ≈ {∅} ↔ ∃𝑓 𝑓:𝐴–1-1-onto→{∅}))
6	5	ibi 267	. . . 4 ⊢ (𝐴 ≈ {∅} → ∃𝑓 𝑓:𝐴–1-1-onto→{∅})
7	2, 6	sylbi 217	. . 3 ⊢ (𝐴 ≈ 1o → ∃𝑓 𝑓:𝐴–1-1-onto→{∅})
8		f1ocnv 6815	. . . . 5 ⊢ (𝑓:𝐴–1-1-onto→{∅} → ◡𝑓:{∅}–1-1-onto→𝐴)
9		f1ofo 6810	. . . . . . 7 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ◡𝑓:{∅}–onto→𝐴)
10		forn 6778	. . . . . . 7 ⊢ (◡𝑓:{∅}–onto→𝐴 → ran ◡𝑓 = 𝐴)
11	9, 10	syl 17	. . . . . 6 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ran ◡𝑓 = 𝐴)
12		f1of 6803	. . . . . . . . 9 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ◡𝑓:{∅}⟶𝐴)
13		0ex 5265	. . . . . . . . . . 11 ⊢ ∅ ∈ V
14	13	fsn2 7111	. . . . . . . . . 10 ⊢ (◡𝑓:{∅}⟶𝐴 ↔ ((◡𝑓‘∅) ∈ 𝐴 ∧ ◡𝑓 = {⟨∅, (◡𝑓‘∅)⟩}))
15	14	simprbi 496	. . . . . . . . 9 ⊢ (◡𝑓:{∅}⟶𝐴 → ◡𝑓 = {⟨∅, (◡𝑓‘∅)⟩})
16	12, 15	syl 17	. . . . . . . 8 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ◡𝑓 = {⟨∅, (◡𝑓‘∅)⟩})
17	16	rneqd 5905	. . . . . . 7 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ran ◡𝑓 = ran {⟨∅, (◡𝑓‘∅)⟩})
18	13	rnsnop 6200	. . . . . . 7 ⊢ ran {⟨∅, (◡𝑓‘∅)⟩} = {(◡𝑓‘∅)}
19	17, 18	eqtrdi 2781	. . . . . 6 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ran ◡𝑓 = {(◡𝑓‘∅)})
20	11, 19	eqtr3d 2767	. . . . 5 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → 𝐴 = {(◡𝑓‘∅)})
21		fvex 6874	. . . . . 6 ⊢ (◡𝑓‘∅) ∈ V
22		sneq 4602	. . . . . . 7 ⊢ (𝑥 = (◡𝑓‘∅) → {𝑥} = {(◡𝑓‘∅)})
23	22	eqeq2d 2741	. . . . . 6 ⊢ (𝑥 = (◡𝑓‘∅) → (𝐴 = {𝑥} ↔ 𝐴 = {(◡𝑓‘∅)}))
24	21, 23	spcev 3575	. . . . 5 ⊢ (𝐴 = {(◡𝑓‘∅)} → ∃𝑥 𝐴 = {𝑥})
25	8, 20, 24	3syl 18	. . . 4 ⊢ (𝑓:𝐴–1-1-onto→{∅} → ∃𝑥 𝐴 = {𝑥})
26	25	exlimiv 1930	. . 3 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→{∅} → ∃𝑥 𝐴 = {𝑥})
27	7, 26	syl 17	. 2 ⊢ (𝐴 ≈ 1o → ∃𝑥 𝐴 = {𝑥})
28		vex 3454	. . . . 5 ⊢ 𝑥 ∈ V
29	28	ensn1 8995	. . . 4 ⊢ {𝑥} ≈ 1o
30		breq1 5113	. . . 4 ⊢ (𝐴 = {𝑥} → (𝐴 ≈ 1o ↔ {𝑥} ≈ 1o))
31	29, 30	mpbiri 258	. . 3 ⊢ (𝐴 = {𝑥} → 𝐴 ≈ 1o)
32	31	exlimiv 1930	. 2 ⊢ (∃𝑥 𝐴 = {𝑥} → 𝐴 ≈ 1o)
33	27, 32	impbii 209	1 ⊢ (𝐴 ≈ 1o ↔ ∃𝑥 𝐴 = {𝑥})

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  Vcvv 3450  ∅c0 4299  {csn 4592  ⟨cop 4598   class class class wbr 5110  ^◡ccnv 5640  ran crn 5642  ⟶wf 6510  –onto→wfo 6512  –1-1-onto→wf1o 6513  ‘cfv 6514  1_oc1o 8430   ≈ cen 8918

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-1o 8437  df-en 8922

This theorem is referenced by:  en1b  8999  reuen1  9000  en1eqsn  9226  en2  9233  card1  9928  pm54.43  9961  hash1elsn  14343  hash1snb  14391  ufildom1  23820  unidifsnel  32471  unidifsnne  32472  funen1cnv  35085  lfuhgr3  35114  snen1g  43520  istermc3  49469