Theorem f1oabexg 7951

Description: The class of all 1-1-onto functions mapping one set to another is a set. (Contributed by Paul Chapman, 25-Feb-2008.) (Proof shortened by AV, 9-Jun-2025.)

Hypothesis

Ref	Expression
f1oabexg.1	⊢ 𝐹 = {𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐵 ∧ 𝜑)}

Assertion

Ref	Expression
f1oabexg	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V)

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Allowed substitution hints:   𝜑(𝑓)   𝐶(𝑓)   𝐷(𝑓)   𝐹(𝑓)

Proof of Theorem f1oabexg

Step	Hyp	Ref	Expression
1		elex 3472	. 2 ⊢ (𝐴 ∈ 𝐶 → 𝐴 ∈ V)
2		elex 3472	. 2 ⊢ (𝐵 ∈ 𝐷 → 𝐵 ∈ V)
3		f1oabexg.1	. . 3 ⊢ 𝐹 = {𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐵 ∧ 𝜑)}
4		f1of 6822	. . . . 5 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴⟶𝐵)
5	4	ad2antrl 741	. . . 4 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝑓:𝐴–1-1-onto→𝐵 ∧ 𝜑)) → 𝑓:𝐴⟶𝐵)
6		simpl 488	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝐴 ∈ V)
7		simpr 490	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝐵 ∈ V)
8	5, 6, 7	fabexd 7947	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑓 ∣ (𝑓:𝐴–1-1-onto→𝐵 ∧ 𝜑)} ∈ V)
9	3, 8	eqeltrid 2865	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝐹 ∈ V)
10	1, 2, 9	syl2an 608	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝐹 ∈ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  Vcvv 3451  ⟶wf 6533  –1-1-onto→wf1o 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7749

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-f1o 6544

This theorem is used by: (None)