HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem fnop 2727
Description: The first argument of an ordered pair in a function belongs to the function's domain.
Hypotheses
Ref Expression
fnbr.1 |- B e. V
fnbr.2 |- C e. V
Assertion
Ref Expression
fnop |- ((F Fn A /\ <.B, C>. e. F) -> B e. A)

Proof of Theorem fnop
StepHypRef Expression
1 fnbr.1 . . 3 |- B e. V
2 fnbr.2 . . 3 |- C e. V
31, 2fnbr 2726 . 2 |- ((F Fn A /\ BFC) -> B e. A)
4 df-br 2063 . 2 |- (BFC <-> <.B, C>. e. F)
53, 4sylan2br 348 1 |- ((F Fn A /\ <.B, C>. e. F) -> B e. A)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196   e. wcel 1092  Vcvv 1348  <.cop 1810   class class class wbr 2054   Fn wfn 2417
This theorem is referenced by:  2elresin 2733  fcoi1 2765  fnopabfv 2858  tfrlem2 2950  tfrlem8 2956  tfrlem9 2957
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-nul 1708  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-dm 2428  df-fn 2433
metamath.org