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

Theorem bnj1525 33993
Description: Technical lemma for bnj1522 33996. 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
bnj1525.1  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
bnj1525.2  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
bnj1525.3  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
bnj1525.4  |-  F  = 
U. C
bnj1525.5  |-  ( ph  <->  ( R  FrSe  A  /\  H  Fn  A  /\  A. x  e.  A  ( H `  x )  =  ( G `  <. x ,  ( H  |`  pred ( x ,  A ,  R ) ) >. ) ) )
bnj1525.6  |-  ( ps  <->  (
ph  /\  F  =/=  H ) )
Assertion
Ref Expression
bnj1525  |-  ( ps 
->  A. x ps )
Distinct variable groups:    x, A    x, H    x, R    x, d    x, f
Allowed substitution hints:    ph( x, f, d)    ps( x, f, d)    A( f, d)    B( x, f, d)    C( x, f, d)    R( f, d)    F( x, f, d)    G( x, f, d)    H( f, d)    Y( x, f, d)

Proof of Theorem bnj1525
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 bnj1525.6 . . 3  |-  ( ps  <->  (
ph  /\  F  =/=  H ) )
2 bnj1525.5 . . . . 5  |-  ( ph  <->  ( R  FrSe  A  /\  H  Fn  A  /\  A. x  e.  A  ( H `  x )  =  ( G `  <. x ,  ( H  |`  pred ( x ,  A ,  R ) ) >. ) ) )
3 nfv 1694 . . . . . 6  |-  F/ x  R  FrSe  A
4 nfv 1694 . . . . . 6  |-  F/ x  H  Fn  A
5 nfra1 2824 . . . . . 6  |-  F/ x A. x  e.  A  ( H `  x )  =  ( G `  <. x ,  ( H  |`  pred ( x ,  A ,  R ) ) >. )
63, 4, 5nf3an 1916 . . . . 5  |-  F/ x
( R  FrSe  A  /\  H  Fn  A  /\  A. x  e.  A  ( H `  x )  =  ( G `  <. x ,  ( H  |`  pred ( x ,  A ,  R ) ) >. ) )
72, 6nfxfr 1632 . . . 4  |-  F/ x ph
8 bnj1525.4 . . . . . 6  |-  F  = 
U. C
9 bnj1525.3 . . . . . . . . 9  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
10 bnj1525.1 . . . . . . . . . 10  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
1110bnj1309 33946 . . . . . . . . 9  |-  ( w  e.  B  ->  A. x  w  e.  B )
129, 11bnj1307 33947 . . . . . . . 8  |-  ( w  e.  C  ->  A. x  w  e.  C )
1312nfcii 2595 . . . . . . 7  |-  F/_ x C
1413nfuni 4240 . . . . . 6  |-  F/_ x U. C
158, 14nfcxfr 2603 . . . . 5  |-  F/_ x F
16 nfcv 2605 . . . . 5  |-  F/_ x H
1715, 16nfne 2774 . . . 4  |-  F/ x  F  =/=  H
187, 17nfan 1914 . . 3  |-  F/ x
( ph  /\  F  =/= 
H )
191, 18nfxfr 1632 . 2  |-  F/ x ps
2019nfri 1860 1  |-  ( ps 
->  A. x ps )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 974   A.wal 1381    = wceq 1383   {cab 2428    =/= wne 2638   A.wral 2793   E.wrex 2794    C_ wss 3461   <.cop 4020   U.cuni 4234    |` cres 4991    Fn wfn 5573   ` cfv 5578    predc-bnj14 33608    FrSe w-bnj15 33612
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-ral 2798  df-rex 2799  df-uni 4235
This theorem is referenced by:  bnj1523  33995
  Copyright terms: Public domain W3C validator