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

Theorem tfrlemibex 6562
Description: The set  B exists. Lemma for tfrlemi1 6565. (Contributed by Jim Kingdon, 17-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)
Hypotheses
Ref Expression
tfrlemisucfn.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
tfrlemisucfn.2  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
tfrlemi1.3  |-  B  =  { h  |  E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) ) }
tfrlemi1.4  |-  ( ph  ->  x  e.  On )
tfrlemi1.5  |-  ( ph  ->  A. z  e.  x  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w ) ) ) )
Assertion
Ref Expression
tfrlemibex  |-  ( ph  ->  B  e.  _V )
Distinct variable groups:    f, g, h, w, x, y, z, A    f, F, g, h, w, x, y, z    ph, w, y    w, B, f, g, h, z    ph, g, h, z
Allowed substitution hints:    ph( x, f)    B( x, y)

Proof of Theorem tfrlemibex
StepHypRef Expression
1 tfrlemisucfn.1 . . . 4  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
2 tfrlemisucfn.2 . . . 4  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
3 tfrlemi1.3 . . . 4  |-  B  =  { h  |  E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) ) }
4 tfrlemi1.4 . . . 4  |-  ( ph  ->  x  e.  On )
5 tfrlemi1.5 . . . 4  |-  ( ph  ->  A. z  e.  x  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w ) ) ) )
61, 2, 3, 4, 5tfrlemibfn 6561 . . 3  |-  ( ph  ->  U. B  Fn  x
)
7 vex 2818 . . 3  |-  x  e. 
_V
8 fnex 5908 . . 3  |-  ( ( U. B  Fn  x  /\  x  e.  _V )  ->  U. B  e.  _V )
96, 7, 8sylancl 413 . 2  |-  ( ph  ->  U. B  e.  _V )
10 uniexb 4596 . 2  |-  ( B  e.  _V  <->  U. B  e. 
_V )
119, 10sylibr 134 1  |-  ( ph  ->  B  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005   A.wal 1396    = wceq 1398   E.wex 1541    e. wcel 2205   {cab 2220   A.wral 2522   E.wrex 2523   _Vcvv 2815    u. cun 3211   {csn 3691   <.cop 3694   U.cuni 3916   Oncon0 4486    |` cres 4753   Fun wfun 5348    Fn wfn 5349   ` cfv 5354
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-in1 619  ax-in2 620  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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-suc 4494  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-recs 6538
This theorem is referenced by:  tfrlemiex  6564
  Copyright terms: Public domain W3C validator