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

Theorem sucinc2 6504
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 4410 . . . . 5  |-  ( B  e.  On  ->  Ord  B )
2 ordsucss 4540 . . . . 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 4450 . . 3  |-  B  C_  suc  B
64, 5sstrdi 3195 . 2  |-  ( ( B  e.  On  /\  A  e.  B )  ->  suc  A  C_  suc  B )
7 onelon 4419 . . 3  |-  ( ( B  e.  On  /\  A  e.  B )  ->  A  e.  On )
8 elex 2774 . . . 4  |-  ( A  e.  On  ->  A  e.  _V )
9 sucexg 4534 . . . 4  |-  ( A  e.  On  ->  suc  A  e.  _V )
10 suceq 4437 . . . . 5  |-  ( z  =  A  ->  suc  z  =  suc  A )
11 sucinc.1 . . . . 5  |-  F  =  ( z  e.  _V  |->  suc  z )
1210, 11fvmptg 5637 . . . 4  |-  ( ( A  e.  _V  /\  suc  A  e.  _V )  ->  ( F `  A
)  =  suc  A
)
138, 9, 12syl2anc 411 . . 3  |-  ( A  e.  On  ->  ( F `  A )  =  suc  A )
147, 13syl 14 . 2  |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  A
)  =  suc  A
)
15 elex 2774 . . . 4  |-  ( B  e.  On  ->  B  e.  _V )
16 sucexg 4534 . . . 4  |-  ( B  e.  On  ->  suc  B  e.  _V )
17 suceq 4437 . . . . 5  |-  ( z  =  B  ->  suc  z  =  suc  B )
1817, 11fvmptg 5637 . . . 4  |-  ( ( B  e.  _V  /\  suc  B  e.  _V )  ->  ( F `  B
)  =  suc  B
)
1915, 16, 18syl2anc 411 . . 3  |-  ( B  e.  On  ->  ( F `  B )  =  suc  B )
2019adantr 276 . 2  |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  B
)  =  suc  B
)
216, 14, 203sstr4d 3228 1  |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  A
)  C_  ( F `  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167   _Vcvv 2763    C_ wss 3157    |-> cmpt 4094   Ord word 4397   Oncon0 4398   suc csuc 4400   ` cfv 5258
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-suc 4406  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator