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

Theorem fnopab 6663
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 6662 . 2 (∀𝑥𝐴 ∃!𝑦𝜑𝐹 Fn 𝐴)
52, 4mpbi 233 1 𝐹 Fn 𝐴
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  ∃!weu 2598  wral 3079  {copab 5167   Fn wfn 6520
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-fun 6527  df-fn 6528
This theorem is referenced by:  fvopab3g  6974
  Copyright terms: Public domain W3C validator