Theorem fnopab 6680

Description: Functionality and domain of an ordered-pair class abstraction. (Contributed by NM, 5-Mar-1996.)

Hypotheses

Ref	Expression
fnopab.1	⊢ (𝑥 ∈ 𝐴 → ∃!𝑦𝜑)
fnopab.2	⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}

Assertion

Ref	Expression
fnopab	⊢ 𝐹 Fn 𝐴

Distinct variable group:   𝑥,𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem fnopab

Step	Hyp	Ref	Expression
1		fnopab.1	. . 3 ⊢ (𝑥 ∈ 𝐴 → ∃!𝑦𝜑)
2	1	rgen 3084	. 2 ⊢ ∀𝑥 ∈ 𝐴 ∃!𝑦𝜑
3		fnopab.2	. . 3 ⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
4	3	fnopabg 6679	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ 𝐹 Fn 𝐴)
5	2, 4	mpbi 233	1 ⊢ 𝐹 Fn 𝐴

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃!weu 2599  ∀wral 3082  {copab 5178   Fn wfn 6538

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-pr 5409

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-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-fun 6545  df-fn 6546

This theorem is used by:  fvopab3g  6991