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

Theorem tfrlemiex 6386
Description: Lemma for tfrlemi1 6387. (Contributed by Jim Kingdon, 18-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
tfrlemiex  |-  ( ph  ->  E. f ( f  Fn  x  /\  A. u  e.  x  (
f `  u )  =  ( F `  ( f  |`  u
) ) ) )
Distinct variable groups:    f, g, h, u, w, x, y, z, A    f, F, g, h, u, w, x, y, z    ph, w, y    u, B, w, f, g, h, z    ph, g, h, z
Allowed substitution hints:    ph( x, u, f)    B( x, y)

Proof of Theorem tfrlemiex
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, 5tfrlemibex 6384 . . 3  |-  ( ph  ->  B  e.  _V )
7 uniexg 4471 . . 3  |-  ( B  e.  _V  ->  U. B  e.  _V )
86, 7syl 14 . 2  |-  ( ph  ->  U. B  e.  _V )
91, 2, 3, 4, 5tfrlemibfn 6383 . . 3  |-  ( ph  ->  U. B  Fn  x
)
101, 2, 3, 4, 5tfrlemiubacc 6385 . . 3  |-  ( ph  ->  A. u  e.  x  ( U. B `  u
)  =  ( F `
 ( U. B  |`  u ) ) )
119, 10jca 306 . 2  |-  ( ph  ->  ( U. B  Fn  x  /\  A. u  e.  x  ( U. B `  u )  =  ( F `  ( U. B  |`  u ) ) ) )
12 fneq1 5343 . . . 4  |-  ( f  =  U. B  -> 
( f  Fn  x  <->  U. B  Fn  x ) )
13 fveq1 5554 . . . . . 6  |-  ( f  =  U. B  -> 
( f `  u
)  =  ( U. B `  u )
)
14 reseq1 4937 . . . . . . 7  |-  ( f  =  U. B  -> 
( f  |`  u
)  =  ( U. B  |`  u ) )
1514fveq2d 5559 . . . . . 6  |-  ( f  =  U. B  -> 
( F `  (
f  |`  u ) )  =  ( F `  ( U. B  |`  u
) ) )
1613, 15eqeq12d 2208 . . . . 5  |-  ( f  =  U. B  -> 
( ( f `  u )  =  ( F `  ( f  |`  u ) )  <->  ( U. B `  u )  =  ( F `  ( U. B  |`  u
) ) ) )
1716ralbidv 2494 . . . 4  |-  ( f  =  U. B  -> 
( A. u  e.  x  ( f `  u )  =  ( F `  ( f  |`  u ) )  <->  A. u  e.  x  ( U. B `  u )  =  ( F `  ( U. B  |`  u
) ) ) )
1812, 17anbi12d 473 . . 3  |-  ( f  =  U. B  -> 
( ( f  Fn  x  /\  A. u  e.  x  ( f `  u )  =  ( F `  ( f  |`  u ) ) )  <-> 
( U. B  Fn  x  /\  A. u  e.  x  ( U. B `  u )  =  ( F `  ( U. B  |`  u ) ) ) ) )
1918spcegv 2849 . 2  |-  ( U. B  e.  _V  ->  ( ( U. B  Fn  x  /\  A. u  e.  x  ( U. B `  u )  =  ( F `  ( U. B  |`  u ) ) )  ->  E. f
( f  Fn  x  /\  A. u  e.  x  ( f `  u
)  =  ( F `
 ( f  |`  u ) ) ) ) )
208, 11, 19sylc 62 1  |-  ( ph  ->  E. f ( f  Fn  x  /\  A. u  e.  x  (
f `  u )  =  ( F `  ( f  |`  u
) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980   A.wal 1362    = wceq 1364   E.wex 1503    e. wcel 2164   {cab 2179   A.wral 2472   E.wrex 2473   _Vcvv 2760    u. cun 3152   {csn 3619   <.cop 3622   U.cuni 3836   Oncon0 4395    |` cres 4662   Fun wfun 5249    Fn wfn 5250   ` cfv 5255
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-iord 4398  df-on 4400  df-suc 4403  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-recs 6360
This theorem is referenced by:  tfrlemi1  6387
  Copyright terms: Public domain W3C validator