Theorem en1 7086

Description: A set is equinumerous to ordinal one iff it is a singleton. (Contributed by NM, 25-Jul-2004.)

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 6701	. . . . 5 ⊢ 1o = {∅}
2	1	breq2i 4138	. . . 4 ⊢ (𝐴 ≈ 1o ↔ 𝐴 ≈ {∅})
3		bren 7030	. . . 4 ⊢ (𝐴 ≈ {∅} ↔ ∃𝑓 𝑓:𝐴–1-1-onto→{∅})
4	2, 3	bitri 184	. . 3 ⊢ (𝐴 ≈ 1o ↔ ∃𝑓 𝑓:𝐴–1-1-onto→{∅})
5		f1ocnv 5652	. . . . 5 ⊢ (𝑓:𝐴–1-1-onto→{∅} → ◡𝑓:{∅}–1-1-onto→𝐴)
6		f1ofo 5646	. . . . . . . 8 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ◡𝑓:{∅}–onto→𝐴)
7		forn 5618	. . . . . . . 8 ⊢ (◡𝑓:{∅}–onto→𝐴 → ran ◡𝑓 = 𝐴)
8	6, 7	syl 14	. . . . . . 7 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ran ◡𝑓 = 𝐴)
9		f1of 5639	. . . . . . . . . 10 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ◡𝑓:{∅}⟶𝐴)
10		0ex 4260	. . . . . . . . . . . 12 ⊢ ∅ ∈ V
11	10	fsn2 5882	. . . . . . . . . . 11 ⊢ (◡𝑓:{∅}⟶𝐴 ↔ ((◡𝑓‘∅) ∈ 𝐴 ∧ ◡𝑓 = {⟨∅, (◡𝑓‘∅)⟩}))
12	11	simprbi 275	. . . . . . . . . 10 ⊢ (◡𝑓:{∅}⟶𝐴 → ◡𝑓 = {⟨∅, (◡𝑓‘∅)⟩})
13	9, 12	syl 14	. . . . . . . . 9 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ◡𝑓 = {⟨∅, (◡𝑓‘∅)⟩})
14	13	rneqd 5011	. . . . . . . 8 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ran ◡𝑓 = ran {⟨∅, (◡𝑓‘∅)⟩})
15	10	rnsnop 5268	. . . . . . . 8 ⊢ ran {⟨∅, (◡𝑓‘∅)⟩} = {(◡𝑓‘∅)}
16	14, 15	eqtrdi 2287	. . . . . . 7 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ran ◡𝑓 = {(◡𝑓‘∅)})
17	8, 16	eqtr3d 2273	. . . . . 6 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → 𝐴 = {(◡𝑓‘∅)})
18	5, 17	syl 14	. . . . 5 ⊢ (𝑓:𝐴–1-1-onto→{∅} → 𝐴 = {(◡𝑓‘∅)})
19		f1ofn 5640	. . . . . . 7 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → ◡𝑓 Fn {∅})
20	10	snid 3740	. . . . . . 7 ⊢ ∅ ∈ {∅}
21		funfvex 5712	. . . . . . . 8 ⊢ ((Fun ◡𝑓 ∧ ∅ ∈ dom ◡𝑓) → (◡𝑓‘∅) ∈ V)
22	21	funfni 5483	. . . . . . 7 ⊢ ((◡𝑓 Fn {∅} ∧ ∅ ∈ {∅}) → (◡𝑓‘∅) ∈ V)
23	19, 20, 22	sylancl 417	. . . . . 6 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → (◡𝑓‘∅) ∈ V)
24		sneq 3720	. . . . . . . 8 ⊢ (𝑥 = (◡𝑓‘∅) → {𝑥} = {(◡𝑓‘∅)})
25	24	eqeq2d 2250	. . . . . . 7 ⊢ (𝑥 = (◡𝑓‘∅) → (𝐴 = {𝑥} ↔ 𝐴 = {(◡𝑓‘∅)}))
26	25	spcegv 2913	. . . . . 6 ⊢ ((◡𝑓‘∅) ∈ V → (𝐴 = {(◡𝑓‘∅)} → ∃𝑥 𝐴 = {𝑥}))
27	23, 26	syl 14	. . . . 5 ⊢ (◡𝑓:{∅}–1-1-onto→𝐴 → (𝐴 = {(◡𝑓‘∅)} → ∃𝑥 𝐴 = {𝑥}))
28	5, 18, 27	sylc 62	. . . 4 ⊢ (𝑓:𝐴–1-1-onto→{∅} → ∃𝑥 𝐴 = {𝑥})
29	28	exlimiv 1651	. . 3 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→{∅} → ∃𝑥 𝐴 = {𝑥})
30	4, 29	sylbi 121	. 2 ⊢ (𝐴 ≈ 1o → ∃𝑥 𝐴 = {𝑥})
31		vex 2824	. . . . 5 ⊢ 𝑥 ∈ V
32	31	ensn1 7083	. . . 4 ⊢ {𝑥} ≈ 1o
33		breq1 4133	. . . 4 ⊢ (𝐴 = {𝑥} → (𝐴 ≈ 1o ↔ {𝑥} ≈ 1o))
34	32, 33	mpbiri 168	. . 3 ⊢ (𝐴 = {𝑥} → 𝐴 ≈ 1o)
35	34	exlimiv 1651	. 2 ⊢ (∃𝑥 𝐴 = {𝑥} → 𝐴 ≈ 1o)
36	30, 35	impbii 126	1 ⊢ (𝐴 ≈ 1o ↔ ∃𝑥 𝐴 = {𝑥})

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209  Vcvv 2821  ∅c0 3520  {csn 3709  ⟨cop 3712   class class class wbr 4130  ^◡ccnv 4773  ran crn 4775   Fn wfn 5372  ⟶wf 5373  –onto→wfo 5375  –1-1-onto→wf1o 5376  ‘cfv 5377  1_oc1o 6680   ≈ cen 7020

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-en 7023

This theorem is used by:  en1bg  7087  reuen1  7088  eqsndc  7210  pm54.43  7536  upgrex  16344  vtxdumgrfival  16539  1loopgrvd2fi  16546