Theorem bnj1034 31038

Description: Technical lemma for bnj69 31078. 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
bnj1034.1	|- ( ph <-> ( f ` (/) ) = pred ( X , A , R ) )
bnj1034.2	|- ( ps <-> A. i e. om ( suc i e. n -> ( f ` suc i ) = U_ y e. ( f ` i ) pred ( y , A , R ) ) )
bnj1034.3	|- ( ch <-> ( n e. D /\ f Fn n /\ ph /\ ps ) )
bnj1034.4	|- ( th <-> ( R FrSe A /\ X e. A ) )
bnj1034.5	|- ( ta <-> ( B e. _V /\ TrFo ( B , A , R ) /\ pred ( X , A , R ) C_ B ) )
bnj1034.7	|- ( ze <-> ( i e. n /\ z e. ( f ` i ) ) )
bnj1034.8	|- D = ( om \ { (/) } )
bnj1034.9	|- K = { f | E. n e. D ( f Fn n /\ ph /\ ps ) }
bnj1034.10	|- ( E. f E. n E. i ( th /\ ta /\ ch /\ ze ) -> z e. B )

Assertion

Ref	Expression
bnj1034	|- ( ( th /\ ta ) -> trCl ( X , A , R ) C_ B )

Distinct variable groups:   A, f, i, n, y   z, A, f, i, n   z, B   D, i   R, f, i, n, y   z, R   f, X, i, n, y   z, X   ta, f, i, n, z   th, f, i, n, z   ph, i

Allowed substitution hints:   ph( y, z, f, n)   ps( y, z, f, i, n)   ch( y, z, f, i, n)   th( y)   ta( y)   ze( y, z, f, i, n)   B( y, f, i, n)   D( y, z, f, n)   K( y, z, f, i, n)

Proof of Theorem bnj1034

Step	Hyp	Ref	Expression
1		bnj1034.1	. 2 |- ( ph <-> ( f ` (/) ) = pred ( X , A , R ) )
2		bnj1034.2	. 2 |- ( ps <-> A. i e. om ( suc i e. n -> ( f ` suc i ) = U_ y e. ( f ` i ) pred ( y , A , R ) ) )
3		bnj1034.3	. 2 |- ( ch <-> ( n e. D /\ f Fn n /\ ph /\ ps ) )
4		bnj1034.4	. 2 |- ( th <-> ( R FrSe A /\ X e. A ) )
5		bnj1034.5	. 2 |- ( ta <-> ( B e. _V /\ TrFo ( B , A , R ) /\ pred ( X , A , R ) C_ B ) )
6		biid 251	. 2 |- ( z e. trCl ( X , A , R ) <-> z e. trCl ( X , A , R ) )
7		bnj1034.7	. 2 |- ( ze <-> ( i e. n /\ z e. ( f ` i ) ) )
8		bnj1034.8	. 2 |- D = ( om \ { (/) } )
9		bnj1034.9	. 2 |- K = { f | E. n e. D ( f Fn n /\ ph /\ ps ) }
10		bnj1034.10	. 2 |- ( E. f E. n E. i ( th /\ ta /\ ch /\ ze ) -> z e. B )
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	bnj1033 31037	1 |- ( ( th /\ ta ) -> trCl ( X , A , R ) C_ B )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   /\ w3a 1037   = wceq 1483   E.wex 1704   e. wcel 1990   {cab 2608   A.wral 2912   E.wrex 2913   _Vcvv 3200   \ cdif 3571   C_ wss 3574   (/)c0 3915   {csn 4177   U_ciun 4520   suc csuc 5725   Fn wfn 5883   ` cfv 5888   omcom 7065   /\ w-bnj17 30752   predc-bnj14 30754   FrSe w-bnj15 30758   trClc-bnj18 30760   TrFow-bnj19 30762

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-v 3202  df-in 3581  df-ss 3588  df-iun 4522  df-fn 5891  df-bnj17 30753  df-bnj18 30761

This theorem is referenced by:  bnj1052  31043  bnj1030  31055