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

Theorem bnj1489 28597
Description: Technical lemma for bnj60 28603. 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
bnj1489.1  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
bnj1489.2  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
bnj1489.3  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
bnj1489.4  |-  ( ta  <->  ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
bnj1489.5  |-  D  =  { x  e.  A  |  -.  E. f ta }
bnj1489.6  |-  ( ps  <->  ( R  FrSe  A  /\  D  =/=  (/) ) )
bnj1489.7  |-  ( ch  <->  ( ps  /\  x  e.  D  /\  A. y  e.  D  -.  y R x ) )
bnj1489.8  |-  ( ta'  <->  [. y  /  x ]. ta )
bnj1489.9  |-  H  =  { f  |  E. y  e.  pred  ( x ,  A ,  R
) ta' }
bnj1489.10  |-  P  = 
U. H
bnj1489.11  |-  Z  = 
<. x ,  ( P  |`  pred ( x ,  A ,  R ) ) >.
bnj1489.12  |-  Q  =  ( P  u.  { <. x ,  ( G `
 Z ) >. } )
Assertion
Ref Expression
bnj1489  |-  ( ch 
->  Q  e.  _V )
Distinct variable groups:    A, d,
f, x    y, A, f, x    B, f    y, D    G, d, f    R, d, f, x    y, R    ps, y    ta, y
Allowed substitution hints:    ps( x, f, d)    ch( x, y, f, d)    ta( x, f, d)    B( x, y, d)    C( x, y, f, d)    D( x, f, d)    P( x, y, f, d)    Q( x, y, f, d)    G( x, y)    H( x, y, f, d)    Y( x, y, f, d)    Z( x, y, f, d)    ta'( x, y, f, d)

Proof of Theorem bnj1489
StepHypRef Expression
1 bnj1489.12 . 2  |-  Q  =  ( P  u.  { <. x ,  ( G `
 Z ) >. } )
2 bnj1489.10 . . . 4  |-  P  = 
U. H
3 bnj1489.7 . . . . . . . 8  |-  ( ch  <->  ( ps  /\  x  e.  D  /\  A. y  e.  D  -.  y R x ) )
4 bnj1489.6 . . . . . . . . 9  |-  ( ps  <->  ( R  FrSe  A  /\  D  =/=  (/) ) )
5 bnj1364 28569 . . . . . . . . . 10  |-  ( R 
FrSe  A  ->  R  Se  A )
6 df-bnj13 28227 . . . . . . . . . 10  |-  ( R  Se  A  <->  A. x  e.  A  pred ( x ,  A ,  R
)  e.  _V )
75, 6sylib 188 . . . . . . . . 9  |-  ( R 
FrSe  A  ->  A. x  e.  A  pred ( x ,  A ,  R
)  e.  _V )
84, 7bnj832 28298 . . . . . . . 8  |-  ( ps 
->  A. x  e.  A  pred ( x ,  A ,  R )  e.  _V )
93, 8bnj835 28300 . . . . . . 7  |-  ( ch 
->  A. x  e.  A  pred ( x ,  A ,  R )  e.  _V )
10 bnj1489.5 . . . . . . . 8  |-  D  =  { x  e.  A  |  -.  E. f ta }
1110, 3bnj1212 28343 . . . . . . 7  |-  ( ch 
->  x  e.  A
)
129, 11bnj1294 28361 . . . . . 6  |-  ( ch 
->  pred ( x ,  A ,  R )  e.  _V )
13 nfv 1610 . . . . . . . . 9  |-  F/ y ps
14 nfv 1610 . . . . . . . . 9  |-  F/ y  x  e.  D
15 nfra1 2627 . . . . . . . . 9  |-  F/ y A. y  e.  D  -.  y R x
1613, 14, 15nf3an 1803 . . . . . . . 8  |-  F/ y ( ps  /\  x  e.  D  /\  A. y  e.  D  -.  y R x )
173, 16nfxfr 1561 . . . . . . 7  |-  F/ y ch
184simplbi 446 . . . . . . . . . . 11  |-  ( ps 
->  R  FrSe  A )
193, 18bnj835 28300 . . . . . . . . . 10  |-  ( ch 
->  R  FrSe  A )
2019adantr 451 . . . . . . . . 9  |-  ( ( ch  /\  y  e. 
pred ( x ,  A ,  R ) )  ->  R  FrSe  A )
21 bnj1489.1 . . . . . . . . . . 11  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
22 bnj1489.2 . . . . . . . . . . 11  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
23 bnj1489.3 . . . . . . . . . . 11  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
24 bnj1489.4 . . . . . . . . . . 11  |-  ( ta  <->  ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
25 bnj1489.8 . . . . . . . . . . 11  |-  ( ta'  <->  [. y  /  x ]. ta )
2621, 22, 23, 24, 10, 4, 3, 25bnj1388 28574 . . . . . . . . . 10  |-  ( ch 
->  A. y  e.  pred  ( x ,  A ,  R ) E. f ta' )
2726r19.21bi 2675 . . . . . . . . 9  |-  ( ( ch  /\  y  e. 
pred ( x ,  A ,  R ) )  ->  E. f ta' )
28 nfv 1610 . . . . . . . . . . . 12  |-  F/ x  R  FrSe  A
29 nfsbc1v 3044 . . . . . . . . . . . . . 14  |-  F/ x [. y  /  x ]. ta
3025, 29nfxfr 1561 . . . . . . . . . . . . 13  |-  F/ x ta'
3130nfex 1795 . . . . . . . . . . . 12  |-  F/ x E. f ta'
3228, 31nfan 1800 . . . . . . . . . . 11  |-  F/ x
( R  FrSe  A  /\  E. f ta' )
3330nfeu 2192 . . . . . . . . . . 11  |-  F/ x E! f ta'
3432, 33nfim 1792 . . . . . . . . . 10  |-  F/ x
( ( R  FrSe  A  /\  E. f ta' )  ->  E! f ta' )
35 sneq 3685 . . . . . . . . . . . . . . . . 17  |-  ( x  =  y  ->  { x }  =  { y } )
36 bnj1318 28566 . . . . . . . . . . . . . . . . 17  |-  ( x  =  y  ->  trCl (
x ,  A ,  R )  =  trCl ( y ,  A ,  R ) )
3735, 36uneq12d 3364 . . . . . . . . . . . . . . . 16  |-  ( x  =  y  ->  ( { x }  u.  trCl ( x ,  A ,  R ) )  =  ( { y }  u.  trCl ( y ,  A ,  R ) ) )
3837eqeq2d 2327 . . . . . . . . . . . . . . 15  |-  ( x  =  y  ->  ( dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) )  <->  dom  f  =  ( { y }  u.  trCl ( y ,  A ,  R ) ) ) )
3938anbi2d 684 . . . . . . . . . . . . . 14  |-  ( x  =  y  ->  (
( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) )  <-> 
( f  e.  C  /\  dom  f  =  ( { y }  u.  trCl ( y ,  A ,  R ) ) ) ) )
4021, 22, 23, 24, 25bnj1373 28571 . . . . . . . . . . . . . 14  |-  ( ta'  <->  (
f  e.  C  /\  dom  f  =  ( { y }  u.  trCl ( y ,  A ,  R ) ) ) )
4139, 40syl6bbr 254 . . . . . . . . . . . . 13  |-  ( x  =  y  ->  (
( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) )  <->  ta' ) )
4241exbidv 1617 . . . . . . . . . . . 12  |-  ( x  =  y  ->  ( E. f ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R
) ) )  <->  E. f ta' ) )
4342anbi2d 684 . . . . . . . . . . 11  |-  ( x  =  y  ->  (
( R  FrSe  A  /\  E. f ( f  e.  C  /\  dom  f  =  ( {
x }  u.  trCl ( x ,  A ,  R ) ) ) )  <->  ( R  FrSe  A  /\  E. f ta' ) ) )
4441eubidv 2184 . . . . . . . . . . 11  |-  ( x  =  y  ->  ( E! f ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R
) ) )  <->  E! f ta' ) )
4543, 44imbi12d 311 . . . . . . . . . 10  |-  ( x  =  y  ->  (
( ( R  FrSe  A  /\  E. f ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )  ->  E! f
( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )  <->  ( ( R 
FrSe  A  /\  E. f ta' )  ->  E! f ta' ) ) )
46 biid 227 . . . . . . . . . . 11  |-  ( ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) )  <-> 
( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
4721, 22, 23, 46bnj1321 28568 . . . . . . . . . 10  |-  ( ( R  FrSe  A  /\  E. f ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R
) ) ) )  ->  E! f ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
4834, 45, 47chvar 1958 . . . . . . . . 9  |-  ( ( R  FrSe  A  /\  E. f ta' )  ->  E! f ta' )
4920, 27, 48syl2anc 642 . . . . . . . 8  |-  ( ( ch  /\  y  e. 
pred ( x ,  A ,  R ) )  ->  E! f ta' )
5049ex 423 . . . . . . 7  |-  ( ch 
->  ( y  e.  pred ( x ,  A ,  R )  ->  E! f ta' ) )
5117, 50ralrimi 2658 . . . . . 6  |-  ( ch 
->  A. y  e.  pred  ( x ,  A ,  R ) E! f ta' )
52 bnj1489.9 . . . . . . 7  |-  H  =  { f  |  E. y  e.  pred  ( x ,  A ,  R
) ta' }
5352a1i 10 . . . . . 6  |-  ( ch 
->  H  =  {
f  |  E. y  e.  pred  ( x ,  A ,  R ) ta' } )
54 biid 227 . . . . . . 7  |-  ( ( 
pred ( x ,  A ,  R )  e.  _V  /\  A. y  e.  pred  ( x ,  A ,  R
) E! f ta'  /\  H  =  { f  |  E. y  e. 
pred  ( x ,  A ,  R ) ta' } )  <->  (  pred ( x ,  A ,  R )  e.  _V  /\ 
A. y  e.  pred  ( x ,  A ,  R ) E! f ta'  /\  H  =  {
f  |  E. y  e.  pred  ( x ,  A ,  R ) ta' } ) )
5554bnj1366 28373 . . . . . 6  |-  ( ( 
pred ( x ,  A ,  R )  e.  _V  /\  A. y  e.  pred  ( x ,  A ,  R
) E! f ta'  /\  H  =  { f  |  E. y  e. 
pred  ( x ,  A ,  R ) ta' } )  ->  H  e.  _V )
5612, 51, 53, 55syl3anc 1182 . . . . 5  |-  ( ch 
->  H  e.  _V )
57 uniexg 4554 . . . . 5  |-  ( H  e.  _V  ->  U. H  e.  _V )
5856, 57syl 15 . . . 4  |-  ( ch 
->  U. H  e.  _V )
592, 58syl5eqel 2400 . . 3  |-  ( ch 
->  P  e.  _V )
60 snex 4253 . . . 4  |-  { <. x ,  ( G `  Z ) >. }  e.  _V
6160a1i 10 . . 3  |-  ( ch 
->  { <. x ,  ( G `  Z )
>. }  e.  _V )
6259, 61bnj1149 28335 . 2  |-  ( ch 
->  ( P  u.  { <. x ,  ( G `
 Z ) >. } )  e.  _V )
631, 62syl5eqel 2400 1  |-  ( ch 
->  Q  e.  _V )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934   E.wex 1532    = wceq 1633    e. wcel 1701   E!weu 2176   {cab 2302    =/= wne 2479   A.wral 2577   E.wrex 2578   {crab 2581   _Vcvv 2822   [.wsbc 3025    u. cun 3184    C_ wss 3186   (/)c0 3489   {csn 3674   <.cop 3677   U.cuni 3864   class class class wbr 4060   dom cdm 4726    |` cres 4728    Fn wfn 5287   ` cfv 5292    predc-bnj14 28224    Se w-bnj13 28226    FrSe w-bnj15 28228    trClc-bnj18 28230
This theorem is referenced by:  bnj1312  28599
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-13 1703  ax-14 1705  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297  ax-rep 4168  ax-sep 4178  ax-nul 4186  ax-pow 4225  ax-pr 4251  ax-un 4549  ax-reg 7351  ax-inf2 7387
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1533  df-nf 1536  df-sb 1640  df-eu 2180  df-mo 2181  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-ne 2481  df-ral 2582  df-rex 2583  df-reu 2584  df-rab 2586  df-v 2824  df-sbc 3026  df-csb 3116  df-dif 3189  df-un 3191  df-in 3193  df-ss 3200  df-pss 3202  df-nul 3490  df-if 3600  df-pw 3661  df-sn 3680  df-pr 3681  df-tp 3682  df-op 3683  df-uni 3865  df-iun 3944  df-br 4061  df-opab 4115  df-mpt 4116  df-tr 4151  df-eprel 4342  df-id 4346  df-po 4351  df-so 4352  df-fr 4389  df-we 4391  df-ord 4432  df-on 4433  df-lim 4434  df-suc 4435  df-om 4694  df-xp 4732  df-rel 4733  df-cnv 4734  df-co 4735  df-dm 4736  df-rn 4737  df-res 4738  df-ima 4739  df-iota 5256  df-fun 5294  df-fn 5295  df-f 5296  df-f1 5297  df-fo 5298  df-f1o 5299  df-fv 5300  df-1o 6521  df-bnj17 28223  df-bnj14 28225  df-bnj13 28227  df-bnj15 28229  df-bnj18 28231  df-bnj19 28233
  Copyright terms: Public domain W3C validator