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

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

Proof of Theorem bnj1491
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 bnj1491.13 . 2  |-  ( ch 
->  ( Q  e.  C  /\  dom  Q  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
2 bnj1491.1 . . . . 5  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
3 bnj1491.2 . . . . 5  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
4 bnj1491.3 . . . . 5  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
5 bnj1491.4 . . . . 5  |-  ( ta  <->  ( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
6 bnj1491.5 . . . . 5  |-  D  =  { x  e.  A  |  -.  E. f ta }
7 bnj1491.6 . . . . 5  |-  ( ps  <->  ( R  FrSe  A  /\  D  =/=  (/) ) )
8 bnj1491.7 . . . . 5  |-  ( ch  <->  ( ps  /\  x  e.  D  /\  A. y  e.  D  -.  y R x ) )
9 bnj1491.8 . . . . 5  |-  ( ta'  <->  [. y  /  x ]. ta )
10 bnj1491.9 . . . . 5  |-  H  =  { f  |  E. y  e.  pred  ( x ,  A ,  R
) ta' }
11 bnj1491.10 . . . . 5  |-  P  = 
U. H
12 bnj1491.11 . . . . 5  |-  Z  = 
<. x ,  ( P  |`  pred ( x ,  A ,  R ) ) >.
13 bnj1491.12 . . . . 5  |-  Q  =  ( P  u.  { <. x ,  ( G `
 Z ) >. } )
142, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13bnj1466 33188 . . . 4  |-  ( w  e.  Q  ->  A. f  w  e.  Q )
1514nfcii 2619 . . 3  |-  F/_ f Q
164bnj1317 32959 . . . . . 6  |-  ( w  e.  C  ->  A. f  w  e.  C )
1716nfcii 2619 . . . . 5  |-  F/_ f C
1815, 17nfel 2642 . . . 4  |-  F/ f  Q  e.  C
1915nfdm 5242 . . . . 5  |-  F/_ f dom  Q
2019nfeq1 2644 . . . 4  |-  F/ f dom  Q  =  ( { x }  u.  trCl ( x ,  A ,  R ) )
2118, 20nfan 1875 . . 3  |-  F/ f ( Q  e.  C  /\  dom  Q  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) )
22 eleq1 2539 . . . 4  |-  ( f  =  Q  ->  (
f  e.  C  <->  Q  e.  C ) )
23 dmeq 5201 . . . . 5  |-  ( f  =  Q  ->  dom  f  =  dom  Q )
2423eqeq1d 2469 . . . 4  |-  ( f  =  Q  ->  ( dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) )  <->  dom  Q  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
2522, 24anbi12d 710 . . 3  |-  ( f  =  Q  ->  (
( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) )  <-> 
( Q  e.  C  /\  dom  Q  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) ) )
2615, 21, 25spcegf 3194 . 2  |-  ( Q  e.  _V  ->  (
( Q  e.  C  /\  dom  Q  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) )  ->  E. f ( f  e.  C  /\  dom  f  =  ( {
x }  u.  trCl ( x ,  A ,  R ) ) ) ) )
271, 26mpan9 469 1  |-  ( ( ch  /\  Q  e. 
_V )  ->  E. f
( f  e.  C  /\  dom  f  =  ( { x }  u.  trCl ( x ,  A ,  R ) ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 973    = wceq 1379   E.wex 1596    e. wcel 1767   {cab 2452    =/= wne 2662   A.wral 2814   E.wrex 2815   {crab 2818   _Vcvv 3113   [.wsbc 3331    u. cun 3474    C_ wss 3476   (/)c0 3785   {csn 4027   <.cop 4033   U.cuni 4245   class class class wbr 4447   dom cdm 4999    |` cres 5001    Fn wfn 5581   ` cfv 5586    predc-bnj14 32820    FrSe w-bnj15 32824    trClc-bnj18 32826
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-xp 5005  df-dm 5009  df-res 5011  df-iota 5549  df-fv 5594
This theorem is referenced by:  bnj1312  33193
  Copyright terms: Public domain W3C validator