Theorem fnopab 6674

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 3080	. 2 ⊢ ∀𝑥 ∈ 𝐴 ∃!𝑦𝜑
3		fnopab.2	. . 3 ⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
4	3	fnopabg 6673	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ 𝐹 Fn 𝐴)
5	2, 4	mpbi 233	1 ⊢ 𝐹 Fn 𝐴

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃!weu 2595  ∀wral 3078  {copab 5171   Fn wfn 6532

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-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-fun 6539  df-fn 6540

This theorem is used by:  fvopab3g  6985