ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fabexg Unicode version

Theorem fabexg 5305
Description: Existence of a set of functions. (Contributed by Paul Chapman, 25-Feb-2008.)
Hypothesis
Ref Expression
fabexg.1  |-  F  =  { x  |  ( x : A --> B  /\  ph ) }
Assertion
Ref Expression
fabexg  |-  ( ( A  e.  C  /\  B  e.  D )  ->  F  e.  _V )
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    ph( x)    C( x)    D( x)    F( x)

Proof of Theorem fabexg
StepHypRef Expression
1 xpexg 4648 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A  X.  B
)  e.  _V )
2 pwexg 4099 . 2  |-  ( ( A  X.  B )  e.  _V  ->  ~P ( A  X.  B
)  e.  _V )
3 fabexg.1 . . . . 5  |-  F  =  { x  |  ( x : A --> B  /\  ph ) }
4 fssxp 5285 . . . . . . . 8  |-  ( x : A --> B  ->  x  C_  ( A  X.  B ) )
5 velpw 3512 . . . . . . . 8  |-  ( x  e.  ~P ( A  X.  B )  <->  x  C_  ( A  X.  B ) )
64, 5sylibr 133 . . . . . . 7  |-  ( x : A --> B  ->  x  e.  ~P ( A  X.  B ) )
76anim1i 338 . . . . . 6  |-  ( ( x : A --> B  /\  ph )  ->  ( x  e.  ~P ( A  X.  B )  /\  ph ) )
87ss2abi 3164 . . . . 5  |-  { x  |  ( x : A --> B  /\  ph ) }  C_  { x  |  ( x  e. 
~P ( A  X.  B )  /\  ph ) }
93, 8eqsstri 3124 . . . 4  |-  F  C_  { x  |  ( x  e.  ~P ( A  X.  B )  /\  ph ) }
10 ssab2 3176 . . . 4  |-  { x  |  ( x  e. 
~P ( A  X.  B )  /\  ph ) }  C_  ~P ( A  X.  B )
119, 10sstri 3101 . . 3  |-  F  C_  ~P ( A  X.  B
)
12 ssexg 4062 . . 3  |-  ( ( F  C_  ~P ( A  X.  B )  /\  ~P ( A  X.  B
)  e.  _V )  ->  F  e.  _V )
1311, 12mpan 420 . 2  |-  ( ~P ( A  X.  B
)  e.  _V  ->  F  e.  _V )
141, 2, 133syl 17 1  |-  ( ( A  e.  C  /\  B  e.  D )  ->  F  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480   {cab 2123   _Vcvv 2681    C_ wss 3066   ~Pcpw 3505    X. cxp 4532   -->wf 5114
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-xp 4540  df-rel 4541  df-cnv 4542  df-dm 4544  df-rn 4545  df-fun 5120  df-fn 5121  df-f 5122
This theorem is referenced by:  fabex  5306  f1oabexg  5372
  Copyright terms: Public domain W3C validator