ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  suctr Unicode version

Theorem suctr 4248
Description: The successor of a transitive class is transitive. (Contributed by Alan Sare, 11-Apr-2009.)
Assertion
Ref Expression
suctr  |-  ( Tr  A  ->  Tr  suc  A
)

Proof of Theorem suctr
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 108 . . . . 5  |-  ( ( z  e.  y  /\  y  e.  suc  A )  ->  y  e.  suc  A )
2 vex 2622 . . . . . 6  |-  y  e. 
_V
32elsuc 4233 . . . . 5  |-  ( y  e.  suc  A  <->  ( y  e.  A  \/  y  =  A ) )
41, 3sylib 120 . . . 4  |-  ( ( z  e.  y  /\  y  e.  suc  A )  ->  ( y  e.  A  \/  y  =  A ) )
5 simpl 107 . . . . . . 7  |-  ( ( z  e.  y  /\  y  e.  suc  A )  ->  z  e.  y )
6 eleq2 2151 . . . . . . 7  |-  ( y  =  A  ->  (
z  e.  y  <->  z  e.  A ) )
75, 6syl5ibcom 153 . . . . . 6  |-  ( ( z  e.  y  /\  y  e.  suc  A )  ->  ( y  =  A  ->  z  e.  A ) )
8 elelsuc 4236 . . . . . 6  |-  ( z  e.  A  ->  z  e.  suc  A )
97, 8syl6 33 . . . . 5  |-  ( ( z  e.  y  /\  y  e.  suc  A )  ->  ( y  =  A  ->  z  e.  suc  A ) )
10 trel 3943 . . . . . . . . 9  |-  ( Tr  A  ->  ( (
z  e.  y  /\  y  e.  A )  ->  z  e.  A ) )
1110expd 254 . . . . . . . 8  |-  ( Tr  A  ->  ( z  e.  y  ->  ( y  e.  A  ->  z  e.  A ) ) )
1211adantrd 273 . . . . . . 7  |-  ( Tr  A  ->  ( (
z  e.  y  /\  y  e.  suc  A )  ->  ( y  e.  A  ->  z  e.  A ) ) )
1312, 8syl8 70 . . . . . 6  |-  ( Tr  A  ->  ( (
z  e.  y  /\  y  e.  suc  A )  ->  ( y  e.  A  ->  z  e.  suc  A ) ) )
14 jao 707 . . . . . 6  |-  ( ( y  e.  A  -> 
z  e.  suc  A
)  ->  ( (
y  =  A  -> 
z  e.  suc  A
)  ->  ( (
y  e.  A  \/  y  =  A )  ->  z  e.  suc  A
) ) )
1513, 14syl6 33 . . . . 5  |-  ( Tr  A  ->  ( (
z  e.  y  /\  y  e.  suc  A )  ->  ( ( y  =  A  ->  z  e.  suc  A )  -> 
( ( y  e.  A  \/  y  =  A )  ->  z  e.  suc  A ) ) ) )
169, 15mpdi 42 . . . 4  |-  ( Tr  A  ->  ( (
z  e.  y  /\  y  e.  suc  A )  ->  ( ( y  e.  A  \/  y  =  A )  ->  z  e.  suc  A ) ) )
174, 16mpdi 42 . . 3  |-  ( Tr  A  ->  ( (
z  e.  y  /\  y  e.  suc  A )  ->  z  e.  suc  A ) )
1817alrimivv 1803 . 2  |-  ( Tr  A  ->  A. z A. y ( ( z  e.  y  /\  y  e.  suc  A )  -> 
z  e.  suc  A
) )
19 dftr2 3938 . 2  |-  ( Tr 
suc  A  <->  A. z A. y
( ( z  e.  y  /\  y  e. 
suc  A )  -> 
z  e.  suc  A
) )
2018, 19sylibr 132 1  |-  ( Tr  A  ->  Tr  suc  A
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    \/ wo 664   A.wal 1287    = wceq 1289    e. wcel 1438   Tr wtr 3936   suc csuc 4192
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-v 2621  df-un 3003  df-in 3005  df-ss 3012  df-sn 3452  df-uni 3654  df-tr 3937  df-suc 4198
This theorem is referenced by:  ordsucim  4317  ordom  4421
  Copyright terms: Public domain W3C validator