MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnopab Structured version   Visualization version   GIF version

Theorem fnopab 6675
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
StepHypRef Expression
1 fnopab.1 . . 3 (𝑥𝐴 → ∃!𝑦𝜑)
21rgen 3081 . 2 𝑥𝐴 ∃!𝑦𝜑
3 fnopab.2 . . 3 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
43fnopabg 6674 . 2 (∀𝑥𝐴 ∃!𝑦𝜑𝐹 Fn 𝐴)
52, 4mpbi 233 1 𝐹 Fn 𝐴
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  ∃!weu 2596  wral 3079  {copab 5174   Fn wfn 6533
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-fun 6540  df-fn 6541
This theorem is referenced by:  fvopab3g  6986
  Copyright terms: Public domain W3C validator