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

Theorem sucinc2 6719
Description: Successor is increasing. (Contributed by Jim Kingdon, 14-Jul-2019.)
Hypothesis
Ref Expression
sucinc.1  |-  F  =  ( z  e.  _V  |->  suc  z )
Assertion
Ref Expression
sucinc2  |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  A
)  C_  ( F `  B ) )
Distinct variable groups:    z, A    z, B
Allowed substitution hint:    F( z)

Proof of Theorem sucinc2
StepHypRef Expression
1 eloni 4520 . . . . 5  |-  ( B  e.  On  ->  Ord  B )
2 ordsucss 4651 . . . . 5  |-  ( Ord 
B  ->  ( A  e.  B  ->  suc  A  C_  B ) )
31, 2syl 14 . . . 4  |-  ( B  e.  On  ->  ( A  e.  B  ->  suc 
A  C_  B )
)
43imp 124 . . 3  |-  ( ( B  e.  On  /\  A  e.  B )  ->  suc  A  C_  B
)
5 sssucid 4560 . . 3  |-  B  C_  suc  B
64, 5sstrdi 3260 . 2  |-  ( ( B  e.  On  /\  A  e.  B )  ->  suc  A  C_  suc  B )
7 onelon 4529 . . 3  |-  ( ( B  e.  On  /\  A  e.  B )  ->  A  e.  On )
8 elex 2833 . . . 4  |-  ( A  e.  On  ->  A  e.  _V )
9 sucexg 4645 . . . 4  |-  ( A  e.  On  ->  suc  A  e.  _V )
10 suceq 4547 . . . . 5  |-  ( z  =  A  ->  suc  z  =  suc  A )
11 sucinc.1 . . . . 5  |-  F  =  ( z  e.  _V  |->  suc  z )
1210, 11fvmptg 5781 . . . 4  |-  ( ( A  e.  _V  /\  suc  A  e.  _V )  ->  ( F `  A
)  =  suc  A
)
138, 9, 12syl2anc 415 . . 3  |-  ( A  e.  On  ->  ( F `  A )  =  suc  A )
147, 13syl 14 . 2  |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  A
)  =  suc  A
)
15 elex 2833 . . . 4  |-  ( B  e.  On  ->  B  e.  _V )
16 sucexg 4645 . . . 4  |-  ( B  e.  On  ->  suc  B  e.  _V )
17 suceq 4547 . . . . 5  |-  ( z  =  B  ->  suc  z  =  suc  B )
1817, 11fvmptg 5781 . . . 4  |-  ( ( B  e.  _V  /\  suc  B  e.  _V )  ->  ( F `  B
)  =  suc  B
)
1915, 16, 18syl2anc 415 . . 3  |-  ( B  e.  On  ->  ( F `  B )  =  suc  B )
2019adantr 276 . 2  |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  B
)  =  suc  B
)
216, 14, 203sstr4d 3293 1  |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  A
)  C_  ( F `  B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    C_ wss 3220    |-> cmpt 4192   Ord word 4507   Oncon0 4508   suc csuc 4510   ` cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator