Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1371 Structured version   Unicode version

Theorem bnj1371 33041
Description: Technical lemma for bnj60 33074. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1371.1  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
bnj1371.2  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
bnj1371.3  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
bnj1371.4  |-  ( ta  <->  ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
bnj1371.5  |-  D  =  { x  e.  A  |  -.  E. f ta }
bnj1371.6  |-  ( ps  <->  ( R  FrSe  A  /\  D  =/=  (/) ) )
bnj1371.7  |-  ( ch  <->  ( ps  /\  x  e.  D  /\  A. y  e.  D  -.  y R x ) )
bnj1371.8  |-  ( ta'  <->  [. y  /  x ]. ta )
bnj1371.9  |-  H  =  { f  |  E. y  e.  pred  ( x ,  A ,  R
) ta' }
bnj1371.10  |-  P  = 
U. H
bnj1371.11  |-  ( ta'  <->  (
f  e.  C  /\  dom  f  =  ( { y }  u.  trCl ( y ,  A ,  R ) ) ) )
Assertion
Ref Expression
bnj1371  |-  ( f  e.  H  ->  Fun  f )
Distinct variable groups:    f, d    y, f
Allowed substitution hints:    ps( x, y, f, d)    ch( x, y, f, d)    ta( x, y, f, d)    A( x, y, f, d)    B( x, y, f, d)    C( x, y, f, d)    D( x, y, f, d)    P( x, y, f, d)    R( x, y, f, d)    G( x, y, f, d)    H( x, y, f, d)    Y( x, y, f, d)    ta'( x, y, f, d)

Proof of Theorem bnj1371
StepHypRef Expression
1 bnj1371.9 . . . . . . 7  |-  H  =  { f  |  E. y  e.  pred  ( x ,  A ,  R
) ta' }
21bnj1436 32854 . . . . . 6  |-  ( f  e.  H  ->  E. y  e.  pred  ( x ,  A ,  R ) ta' )
3 rexex 2916 . . . . . 6  |-  ( E. y  e.  pred  (
x ,  A ,  R ) ta'  ->  E. y ta' )
42, 3syl 16 . . . . 5  |-  ( f  e.  H  ->  E. y ta' )
5 bnj1371.11 . . . . . 6  |-  ( ta'  <->  (
f  e.  C  /\  dom  f  =  ( { y }  u.  trCl ( y ,  A ,  R ) ) ) )
65exbii 1639 . . . . 5  |-  ( E. y ta'  <->  E. y ( f  e.  C  /\  dom  f  =  ( {
y }  u.  trCl ( y ,  A ,  R ) ) ) )
74, 6sylib 196 . . . 4  |-  ( f  e.  H  ->  E. y
( f  e.  C  /\  dom  f  =  ( { y }  u.  trCl ( y ,  A ,  R ) ) ) )
8 exsimpl 1649 . . . 4  |-  ( E. y ( f  e.  C  /\  dom  f  =  ( { y }  u.  trCl (
y ,  A ,  R ) ) )  ->  E. y  f  e.  C )
97, 8syl 16 . . 3  |-  ( f  e.  H  ->  E. y 
f  e.  C )
10 bnj1371.3 . . . . . . 7  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
1110abeq2i 2589 . . . . . 6  |-  ( f  e.  C  <->  E. d  e.  B  ( f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) )
1211bnj1238 32821 . . . . 5  |-  ( f  e.  C  ->  E. d  e.  B  f  Fn  d )
13 fnfun 5671 . . . . 5  |-  ( f  Fn  d  ->  Fun  f )
1412, 13bnj31 32729 . . . 4  |-  ( f  e.  C  ->  E. d  e.  B  Fun  f )
1514bnj1265 32827 . . 3  |-  ( f  e.  C  ->  Fun  f )
169, 15bnj593 32758 . 2  |-  ( f  e.  H  ->  E. y Fun  f )
1716bnj937 32786 1  |-  ( f  e.  H  ->  Fun  f )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 968    = wceq 1374   E.wex 1591    e. wcel 1762   {cab 2447    =/= wne 2657   A.wral 2809   E.wrex 2810   {crab 2813   [.wsbc 3326    u. cun 3469    C_ wss 3471   (/)c0 3780   {csn 4022   <.cop 4028   U.cuni 4240   class class class wbr 4442   dom cdm 4994    |` cres 4996   Fun wfun 5575    Fn wfn 5576   ` cfv 5581    predc-bnj14 32697    FrSe w-bnj15 32701    trClc-bnj18 32703
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-12 1798  ax-ext 2440
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1377  df-ex 1592  df-sb 1707  df-clab 2448  df-cleq 2454  df-clel 2457  df-ral 2814  df-rex 2815  df-fn 5584
This theorem is referenced by:  bnj1384  33044
  Copyright terms: Public domain W3C validator