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

Theorem fopab3 3832
Description: Functionality of an ordered-pair class abstraction.
Hypotheses
Ref Expression
fopab2.1 |- F = {<.x, y>. | (x e. A /\ y = C)}
rnssopab.2 |- C e. V
Assertion
Ref Expression
fopab3 |- (ran F (_ B <-> F:A-->B)
Distinct variable groups:   x,y,A   x,B,y   y,C

Proof of Theorem fopab3
StepHypRef Expression
1 fopab2.1 . . 3 |- F = {<.x, y>. | (x e. A /\ y = C)}
2 rnssopab.2 . . 3 |- C e. V
31, 2rnssopab 3831 . 2 |- (A.x e. A C e. B <-> ran F (_ B)
41fopab2 3829 . 2 |- (A.x e. A C e. B <-> F:A-->B)
53, 4bitr3 175 1 |- (ran F (_ B <-> F:A-->B)
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223   = wceq 958   e. wcel 960  A.wral 1648  Vcvv 1814   (_ wss 2050  {copab 2671  ran crn 3177  -->wf 3184
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-id 2841  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fn 3199  df-f 3200  df-fv 3204
Copyright terms: Public domain