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

Theorem fabexg 5532
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 4846 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A  X.  B
)  e.  _V )
2 pwexg 4276 . 2  |-  ( ( A  X.  B )  e.  _V  ->  ~P ( A  X.  B
)  e.  _V )
3 fabexg.1 . . . . 5  |-  F  =  { x  |  ( x : A --> B  /\  ph ) }
4 fssxp 5510 . . . . . . . 8  |-  ( x : A --> B  ->  x  C_  ( A  X.  B ) )
5 velpw 3663 . . . . . . . 8  |-  ( x  e.  ~P ( A  X.  B )  <->  x  C_  ( A  X.  B ) )
64, 5sylibr 134 . . . . . . 7  |-  ( x : A --> B  ->  x  e.  ~P ( A  X.  B ) )
76anim1i 340 . . . . . 6  |-  ( ( x : A --> B  /\  ph )  ->  ( x  e.  ~P ( A  X.  B )  /\  ph ) )
87ss2abi 3300 . . . . 5  |-  { x  |  ( x : A --> B  /\  ph ) }  C_  { x  |  ( x  e. 
~P ( A  X.  B )  /\  ph ) }
93, 8eqsstri 3260 . . . 4  |-  F  C_  { x  |  ( x  e.  ~P ( A  X.  B )  /\  ph ) }
10 ssab2 3312 . . . 4  |-  { x  |  ( x  e. 
~P ( A  X.  B )  /\  ph ) }  C_  ~P ( A  X.  B )
119, 10sstri 3237 . . 3  |-  F  C_  ~P ( A  X.  B
)
12 ssexg 4233 . . 3  |-  ( ( F  C_  ~P ( A  X.  B )  /\  ~P ( A  X.  B
)  e.  _V )  ->  F  e.  _V )
1311, 12mpan 424 . 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 104    = wceq 1398    e. wcel 2202   {cab 2217   _Vcvv 2803    C_ wss 3201   ~Pcpw 3656    X. cxp 4729   -->wf 5329
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-xp 4737  df-rel 4738  df-cnv 4739  df-dm 4741  df-rn 4742  df-fun 5335  df-fn 5336  df-f 5337
This theorem is referenced by:  fabex  5533  f1oabexg  5604
  Copyright terms: Public domain W3C validator