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

Theorem bnj1147 31062
Description: Property of  trCl. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Assertion
Ref Expression
bnj1147  |-  trCl ( X ,  A ,  R )  C_  A

Proof of Theorem bnj1147
Dummy variables  f 
i  j  n  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 biid 251 . 2  |-  ( ( f `  (/) )  = 
pred ( X ,  A ,  R )  <->  ( f `  (/) )  = 
pred ( X ,  A ,  R )
)
2 biid 251 . 2  |-  ( A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `
 suc  i )  =  U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) ) )
3 eqid 2622 . 2  |-  ( om 
\  { (/) } )  =  ( om  \  { (/)
} )
4 eqid 2622 . 2  |-  { f  |  E. n  e.  ( om  \  { (/)
} ) ( f  Fn  n  /\  (
f `  (/) )  = 
pred ( X ,  A ,  R )  /\  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) ) }  =  { f  |  E. n  e.  ( om  \  { (/)
} ) ( f  Fn  n  /\  (
f `  (/) )  = 
pred ( X ,  A ,  R )  /\  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) ) }
5 biid 251 . 2  |-  ( ( n  e.  ( om 
\  { (/) } )  /\  f  Fn  n  /\  ( f `  (/) )  = 
pred ( X ,  A ,  R )  /\  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )  <-> 
( n  e.  ( om  \  { (/) } )  /\  f  Fn  n  /\  ( f `
 (/) )  =  pred ( X ,  A ,  R )  /\  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) ) )
6 biid 251 . 2  |-  ( ( ( i  =/=  (/)  /\  i  e.  n  /\  (
n  e.  ( om 
\  { (/) } )  /\  f  Fn  n  /\  ( f `  (/) )  = 
pred ( X ,  A ,  R )  /\  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) ) )  /\  ( j  e.  n  /\  i  =  suc  j ) )  <-> 
( ( i  =/=  (/)  /\  i  e.  n  /\  ( n  e.  ( om  \  { (/) } )  /\  f  Fn  n  /\  ( f `
 (/) )  =  pred ( X ,  A ,  R )  /\  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) ) )  /\  ( j  e.  n  /\  i  =  suc  j ) ) )
71, 2, 3, 4, 5, 6bnj1145 31061 1  |-  trCl ( X ,  A ,  R )  C_  A
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   {cab 2608    =/= wne 2794   A.wral 2912   E.wrex 2913    \ 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    trClc-bnj18 30760
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-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-tr 4753  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fn 5891  df-fv 5896  df-om 7066  df-bnj17 30753  df-bnj14 30755  df-bnj18 30761
This theorem is referenced by:  bnj1137  31063  bnj1173  31070  bnj1177  31074  bnj1408  31104  bnj1417  31109  bnj1452  31120
  Copyright terms: Public domain W3C validator