Theorem f1oen3g 8961

Description: The domain and range of a one-to-one, onto set function are equinumerous. This variation of f1oeng 8965 does not require the Axiom of Replacement nor the Axiom of Power Sets. (Contributed by NM, 13-Jan-2007.) (Revised by Mario Carneiro, 10-Sep-2015.)

Assertion

Ref	Expression
f1oen3g	⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1-onto→𝐵) → 𝐴 ≈ 𝐵)

Proof of Theorem f1oen3g

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1oeq1 6808	. . . 4 ⊢ (𝑓 = 𝐹 → (𝑓:𝐴–1-1-onto→𝐵 ↔ 𝐹:𝐴–1-1-onto→𝐵))
2	1	spcegv 3555	. . 3 ⊢ (𝐹 ∈ 𝑉 → (𝐹:𝐴–1-1-onto→𝐵 → ∃𝑓 𝑓:𝐴–1-1-onto→𝐵))
3	2	imp 411	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1-onto→𝐵) → ∃𝑓 𝑓:𝐴–1-1-onto→𝐵)
4		bren 8951	. 2 ⊢ (𝐴 ≈ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵)
5	3, 4	sylibr 237	1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1-onto→𝐵) → 𝐴 ≈ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400  ∃wex 1808   ∈ wcel 2142   class class class wbr 5108  –1-1-onto→wf1o 6535   ≈ cen 8938

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-en 8942

This theorem is used by:  f1oen2g  8963  f1imaen3g  9011  unen  9040  domdifsn  9046  domunsncan  9063  sbthlem10  9082  domssex  9124  pssnn  9151  f1oenfi  9161  f1oenfirn  9162  sbthfilem  9180  sucdom2  9185  oien  9498  infdifsn  9624  fin4en1  10299  fin23lem21  10329  hashf1lem2  14500  odinf  19639  gsumval3lem2  19982  gsumval3  19983  hmphen2  23967  fnpreimac  33026  pibt2  38091