MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  seqid2 Unicode version

Theorem seqid2 11092
Description: The last few terms of a sequence that ends with all zeroes (or whatever the identity  Z is for operation  .+) are all the same. (Contributed by Mario Carneiro, 13-Jul-2013.) (Revised by Mario Carneiro, 27-May-2014.)
Hypotheses
Ref Expression
seqid2.1  |-  ( (
ph  /\  x  e.  S )  ->  (
x  .+  Z )  =  x )
seqid2.2  |-  ( ph  ->  K  e.  ( ZZ>= `  M ) )
seqid2.3  |-  ( ph  ->  N  e.  ( ZZ>= `  K ) )
seqid2.4  |-  ( ph  ->  (  seq  M ( 
.+  ,  F ) `
 K )  e.  S )
seqid2.5  |-  ( (
ph  /\  x  e.  ( ( K  + 
1 ) ... N
) )  ->  ( F `  x )  =  Z )
Assertion
Ref Expression
seqid2  |-  ( ph  ->  (  seq  M ( 
.+  ,  F ) `
 K )  =  (  seq  M ( 
.+  ,  F ) `
 N ) )
Distinct variable groups:    x, F    x, K    x, M    x, N    ph, x    x, S    x, 
.+    x, Z

Proof of Theorem seqid2
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 seqid2.3 . . 3  |-  ( ph  ->  N  e.  ( ZZ>= `  K ) )
2 eluzfz2 10804 . . 3  |-  ( N  e.  ( ZZ>= `  K
)  ->  N  e.  ( K ... N ) )
31, 2syl 15 . 2  |-  ( ph  ->  N  e.  ( K ... N ) )
4 eleq1 2343 . . . . . 6  |-  ( x  =  K  ->  (
x  e.  ( K ... N )  <->  K  e.  ( K ... N ) ) )
5 fveq2 5525 . . . . . . 7  |-  ( x  =  K  ->  (  seq  M (  .+  ,  F ) `  x
)  =  (  seq 
M (  .+  ,  F ) `  K
) )
65eqeq2d 2294 . . . . . 6  |-  ( x  =  K  ->  (
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  x
)  <->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 K ) ) )
74, 6imbi12d 311 . . . . 5  |-  ( x  =  K  ->  (
( x  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 x ) )  <-> 
( K  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 K ) ) ) )
87imbi2d 307 . . . 4  |-  ( x  =  K  ->  (
( ph  ->  ( x  e.  ( K ... N )  ->  (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  x
) ) )  <->  ( ph  ->  ( K  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 K ) ) ) ) )
9 eleq1 2343 . . . . . 6  |-  ( x  =  n  ->  (
x  e.  ( K ... N )  <->  n  e.  ( K ... N ) ) )
10 fveq2 5525 . . . . . . 7  |-  ( x  =  n  ->  (  seq  M (  .+  ,  F ) `  x
)  =  (  seq 
M (  .+  ,  F ) `  n
) )
1110eqeq2d 2294 . . . . . 6  |-  ( x  =  n  ->  (
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  x
)  <->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 n ) ) )
129, 11imbi12d 311 . . . . 5  |-  ( x  =  n  ->  (
( x  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 x ) )  <-> 
( n  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 n ) ) ) )
1312imbi2d 307 . . . 4  |-  ( x  =  n  ->  (
( ph  ->  ( x  e.  ( K ... N )  ->  (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  x
) ) )  <->  ( ph  ->  ( n  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 n ) ) ) ) )
14 eleq1 2343 . . . . . 6  |-  ( x  =  ( n  + 
1 )  ->  (
x  e.  ( K ... N )  <->  ( n  +  1 )  e.  ( K ... N
) ) )
15 fveq2 5525 . . . . . . 7  |-  ( x  =  ( n  + 
1 )  ->  (  seq  M (  .+  ,  F ) `  x
)  =  (  seq 
M (  .+  ,  F ) `  (
n  +  1 ) ) )
1615eqeq2d 2294 . . . . . 6  |-  ( x  =  ( n  + 
1 )  ->  (
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  x
)  <->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 ( n  + 
1 ) ) ) )
1714, 16imbi12d 311 . . . . 5  |-  ( x  =  ( n  + 
1 )  ->  (
( x  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 x ) )  <-> 
( ( n  + 
1 )  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 ( n  + 
1 ) ) ) ) )
1817imbi2d 307 . . . 4  |-  ( x  =  ( n  + 
1 )  ->  (
( ph  ->  ( x  e.  ( K ... N )  ->  (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  x
) ) )  <->  ( ph  ->  ( ( n  + 
1 )  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 ( n  + 
1 ) ) ) ) ) )
19 eleq1 2343 . . . . . 6  |-  ( x  =  N  ->  (
x  e.  ( K ... N )  <->  N  e.  ( K ... N ) ) )
20 fveq2 5525 . . . . . . 7  |-  ( x  =  N  ->  (  seq  M (  .+  ,  F ) `  x
)  =  (  seq 
M (  .+  ,  F ) `  N
) )
2120eqeq2d 2294 . . . . . 6  |-  ( x  =  N  ->  (
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  x
)  <->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 N ) ) )
2219, 21imbi12d 311 . . . . 5  |-  ( x  =  N  ->  (
( x  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 x ) )  <-> 
( N  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 N ) ) ) )
2322imbi2d 307 . . . 4  |-  ( x  =  N  ->  (
( ph  ->  ( x  e.  ( K ... N )  ->  (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  x
) ) )  <->  ( ph  ->  ( N  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 N ) ) ) ) )
24 eqidd 2284 . . . . 5  |-  ( K  e.  ( K ... N )  ->  (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  K
) )
2524a1ii 24 . . . 4  |-  ( K  e.  ZZ  ->  ( ph  ->  ( K  e.  ( K ... N
)  ->  (  seq  M (  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 K ) ) ) )
26 peano2fzr 10808 . . . . . . . . . 10  |-  ( ( n  e.  ( ZZ>= `  K )  /\  (
n  +  1 )  e.  ( K ... N ) )  ->  n  e.  ( K ... N ) )
2726adantl 452 . . . . . . . . 9  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  n  e.  ( K ... N ) )
2827expr 598 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( ZZ>= `  K )
)  ->  ( (
n  +  1 )  e.  ( K ... N )  ->  n  e.  ( K ... N
) ) )
2928imim1d 69 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( ZZ>= `  K )
)  ->  ( (
n  e.  ( K ... N )  -> 
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  n
) )  ->  (
( n  +  1 )  e.  ( K ... N )  -> 
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  n
) ) ) )
30 oveq1 5865 . . . . . . . . . 10  |-  ( (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  n
)  ->  ( (  seq  M (  .+  ,  F ) `  K
)  .+  ( F `  ( n  +  1 ) ) )  =  ( (  seq  M
(  .+  ,  F
) `  n )  .+  ( F `  (
n  +  1 ) ) ) )
31 eluzp1p1 10253 . . . . . . . . . . . . . . . 16  |-  ( n  e.  ( ZZ>= `  K
)  ->  ( n  +  1 )  e.  ( ZZ>= `  ( K  +  1 ) ) )
3231ad2antrl 708 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  ( n  +  1 )  e.  ( ZZ>= `  ( K  +  1 ) ) )
33 elfzuz3 10795 . . . . . . . . . . . . . . . 16  |-  ( ( n  +  1 )  e.  ( K ... N )  ->  N  e.  ( ZZ>= `  ( n  +  1 ) ) )
3433ad2antll 709 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  N  e.  ( ZZ>= `  ( n  +  1 ) ) )
35 elfzuzb 10792 . . . . . . . . . . . . . . 15  |-  ( ( n  +  1 )  e.  ( ( K  +  1 ) ... N )  <->  ( (
n  +  1 )  e.  ( ZZ>= `  ( K  +  1 ) )  /\  N  e.  ( ZZ>= `  ( n  +  1 ) ) ) )
3632, 34, 35sylanbrc 645 . . . . . . . . . . . . . 14  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  ( n  +  1 )  e.  ( ( K  + 
1 ) ... N
) )
37 seqid2.5 . . . . . . . . . . . . . . . 16  |-  ( (
ph  /\  x  e.  ( ( K  + 
1 ) ... N
) )  ->  ( F `  x )  =  Z )
3837ralrimiva 2626 . . . . . . . . . . . . . . 15  |-  ( ph  ->  A. x  e.  ( ( K  +  1 ) ... N ) ( F `  x
)  =  Z )
3938adantr 451 . . . . . . . . . . . . . 14  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  A. x  e.  ( ( K  + 
1 ) ... N
) ( F `  x )  =  Z )
40 fveq2 5525 . . . . . . . . . . . . . . . 16  |-  ( x  =  ( n  + 
1 )  ->  ( F `  x )  =  ( F `  ( n  +  1
) ) )
4140eqeq1d 2291 . . . . . . . . . . . . . . 15  |-  ( x  =  ( n  + 
1 )  ->  (
( F `  x
)  =  Z  <->  ( F `  ( n  +  1 ) )  =  Z ) )
4241rspcv 2880 . . . . . . . . . . . . . 14  |-  ( ( n  +  1 )  e.  ( ( K  +  1 ) ... N )  ->  ( A. x  e.  (
( K  +  1 ) ... N ) ( F `  x
)  =  Z  -> 
( F `  (
n  +  1 ) )  =  Z ) )
4336, 39, 42sylc 56 . . . . . . . . . . . . 13  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  ( F `  ( n  +  1 ) )  =  Z )
4443oveq2d 5874 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  ( (  seq  M (  .+  ,  F ) `  K
)  .+  ( F `  ( n  +  1 ) ) )  =  ( (  seq  M
(  .+  ,  F
) `  K )  .+  Z ) )
45 seqid2.4 . . . . . . . . . . . . . 14  |-  ( ph  ->  (  seq  M ( 
.+  ,  F ) `
 K )  e.  S )
46 seqid2.1 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  x  e.  S )  ->  (
x  .+  Z )  =  x )
4746ralrimiva 2626 . . . . . . . . . . . . . 14  |-  ( ph  ->  A. x  e.  S  ( x  .+  Z )  =  x )
48 oveq1 5865 . . . . . . . . . . . . . . . 16  |-  ( x  =  (  seq  M
(  .+  ,  F
) `  K )  ->  ( x  .+  Z
)  =  ( (  seq  M (  .+  ,  F ) `  K
)  .+  Z )
)
49 id 19 . . . . . . . . . . . . . . . 16  |-  ( x  =  (  seq  M
(  .+  ,  F
) `  K )  ->  x  =  (  seq 
M (  .+  ,  F ) `  K
) )
5048, 49eqeq12d 2297 . . . . . . . . . . . . . . 15  |-  ( x  =  (  seq  M
(  .+  ,  F
) `  K )  ->  ( ( x  .+  Z )  =  x  <-> 
( (  seq  M
(  .+  ,  F
) `  K )  .+  Z )  =  (  seq  M (  .+  ,  F ) `  K
) ) )
5150rspcv 2880 . . . . . . . . . . . . . 14  |-  ( (  seq  M (  .+  ,  F ) `  K
)  e.  S  -> 
( A. x  e.  S  ( x  .+  Z )  =  x  ->  ( (  seq 
M (  .+  ,  F ) `  K
)  .+  Z )  =  (  seq  M ( 
.+  ,  F ) `
 K ) ) )
5245, 47, 51sylc 56 . . . . . . . . . . . . 13  |-  ( ph  ->  ( (  seq  M
(  .+  ,  F
) `  K )  .+  Z )  =  (  seq  M (  .+  ,  F ) `  K
) )
5352adantr 451 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  ( (  seq  M (  .+  ,  F ) `  K
)  .+  Z )  =  (  seq  M ( 
.+  ,  F ) `
 K ) )
5444, 53eqtr2d 2316 . . . . . . . . . . 11  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  (  seq  M (  .+  ,  F
) `  K )  =  ( (  seq 
M (  .+  ,  F ) `  K
)  .+  ( F `  ( n  +  1 ) ) ) )
55 simprl 732 . . . . . . . . . . . . 13  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  n  e.  ( ZZ>= `  K )
)
56 seqid2.2 . . . . . . . . . . . . . 14  |-  ( ph  ->  K  e.  ( ZZ>= `  M ) )
5756adantr 451 . . . . . . . . . . . . 13  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  K  e.  ( ZZ>= `  M )
)
58 uztrn 10244 . . . . . . . . . . . . 13  |-  ( ( n  e.  ( ZZ>= `  K )  /\  K  e.  ( ZZ>= `  M )
)  ->  n  e.  ( ZZ>= `  M )
)
5955, 57, 58syl2anc 642 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  n  e.  ( ZZ>= `  M )
)
60 seqp1 11061 . . . . . . . . . . . 12  |-  ( n  e.  ( ZZ>= `  M
)  ->  (  seq  M (  .+  ,  F
) `  ( n  +  1 ) )  =  ( (  seq 
M (  .+  ,  F ) `  n
)  .+  ( F `  ( n  +  1 ) ) ) )
6159, 60syl 15 . . . . . . . . . . 11  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  (  seq  M (  .+  ,  F
) `  ( n  +  1 ) )  =  ( (  seq 
M (  .+  ,  F ) `  n
)  .+  ( F `  ( n  +  1 ) ) ) )
6254, 61eqeq12d 2297 . . . . . . . . . 10  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  ( (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  (
n  +  1 ) )  <->  ( (  seq 
M (  .+  ,  F ) `  K
)  .+  ( F `  ( n  +  1 ) ) )  =  ( (  seq  M
(  .+  ,  F
) `  n )  .+  ( F `  (
n  +  1 ) ) ) ) )
6330, 62syl5ibr 212 . . . . . . . . 9  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  K )  /\  ( n  +  1 )  e.  ( K ... N ) ) )  ->  ( (  seq  M (  .+  ,  F ) `  K
)  =  (  seq 
M (  .+  ,  F ) `  n
)  ->  (  seq  M (  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 ( n  + 
1 ) ) ) )
6463expr 598 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( ZZ>= `  K )
)  ->  ( (
n  +  1 )  e.  ( K ... N )  ->  (
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  n
)  ->  (  seq  M (  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 ( n  + 
1 ) ) ) ) )
6564a2d 23 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( ZZ>= `  K )
)  ->  ( (
( n  +  1 )  e.  ( K ... N )  -> 
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  n
) )  ->  (
( n  +  1 )  e.  ( K ... N )  -> 
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  (
n  +  1 ) ) ) ) )
6629, 65syld 40 . . . . . 6  |-  ( (
ph  /\  n  e.  ( ZZ>= `  K )
)  ->  ( (
n  e.  ( K ... N )  -> 
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  n
) )  ->  (
( n  +  1 )  e.  ( K ... N )  -> 
(  seq  M (  .+  ,  F ) `  K )  =  (  seq  M (  .+  ,  F ) `  (
n  +  1 ) ) ) ) )
6766expcom 424 . . . . 5  |-  ( n  e.  ( ZZ>= `  K
)  ->  ( ph  ->  ( ( n  e.  ( K ... N
)  ->  (  seq  M (  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 n ) )  ->  ( ( n  +  1 )  e.  ( K ... N
)  ->  (  seq  M (  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 ( n  + 
1 ) ) ) ) ) )
6867a2d 23 . . . 4  |-  ( n  e.  ( ZZ>= `  K
)  ->  ( ( ph  ->  ( n  e.  ( K ... N
)  ->  (  seq  M (  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 n ) ) )  ->  ( ph  ->  ( ( n  + 
1 )  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 ( n  + 
1 ) ) ) ) ) )
698, 13, 18, 23, 25, 68uzind4 10276 . . 3  |-  ( N  e.  ( ZZ>= `  K
)  ->  ( ph  ->  ( N  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 N ) ) ) )
701, 69mpcom 32 . 2  |-  ( ph  ->  ( N  e.  ( K ... N )  ->  (  seq  M
(  .+  ,  F
) `  K )  =  (  seq  M ( 
.+  ,  F ) `
 N ) ) )
713, 70mpd 14 1  |-  ( ph  ->  (  seq  M ( 
.+  ,  F ) `
 K )  =  (  seq  M ( 
.+  ,  F ) `
 N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684   A.wral 2543   ` cfv 5255  (class class class)co 5858   1c1 8738    + caddc 8740   ZZcz 10024   ZZ>=cuz 10230   ...cfz 10782    seq cseq 11046
This theorem is referenced by:  seqcoll  11401  seqcoll2  11402  fsumcvg  12185  ovolicc1  18875  lgsdilem2  20570
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-cnex 8793  ax-resscn 8794  ax-1cn 8795  ax-icn 8796  ax-addcl 8797  ax-addrcl 8798  ax-mulcl 8799  ax-mulrcl 8800  ax-mulcom 8801  ax-addass 8802  ax-mulass 8803  ax-distr 8804  ax-i2m1 8805  ax-1ne0 8806  ax-1rid 8807  ax-rnegex 8808  ax-rrecex 8809  ax-cnre 8810  ax-pre-lttri 8811  ax-pre-lttrn 8812  ax-pre-ltadd 8813  ax-pre-mulgt0 8814
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-riota 6304  df-recs 6388  df-rdg 6423  df-er 6660  df-en 6864  df-dom 6865  df-sdom 6866  df-pnf 8869  df-mnf 8870  df-xr 8871  df-ltxr 8872  df-le 8873  df-sub 9039  df-neg 9040  df-nn 9747  df-n0 9966  df-z 10025  df-uz 10231  df-fz 10783  df-seq 11047
  Copyright terms: Public domain W3C validator