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

Theorem fnopab 6485
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 3148 . 2 𝑥𝐴 ∃!𝑦𝜑
3 fnopab.2 . . 3 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
43fnopabg 6484 . 2 (∀𝑥𝐴 ∃!𝑦𝜑𝐹 Fn 𝐴)
52, 4mpbi 232 1 𝐹 Fn 𝐴
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  ∃!weu 2649  wral 3138  {copab 5127   Fn wfn 6349
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-br 5066  df-opab 5128  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-fun 6356  df-fn 6357
This theorem is referenced by:  fvopab3g  6762
  Copyright terms: Public domain W3C validator