Theorem nninfdclemcl 13059

Description: Lemma for nninfdc 13064. (Contributed by Jim Kingdon, 25-Sep-2024.)

Hypotheses

Ref	Expression
nninfdclemf.a	|- ( ph -> A C_ NN )
nninfdclemf.dc	|- ( ph -> A. x e. NN DECID x e. A )
nninfdclemf.nb	|- ( ph -> A. m e. NN E. n e. A m < n )
nninfdclemcl.p	|- ( ph -> P e. A )
nninfdclemcl.q	|- ( ph -> Q e. A )

Assertion

Ref	Expression
nninfdclemcl	|- ( ph -> ( P ( y e. NN , z e. NN |-> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) ) Q ) e. A )

Distinct variable groups:   x, A   y, A, z   A, m, n   x, P   P, m, n   y, P, z   y, Q, z   m, n

Allowed substitution hints:   ph( x, y, z, m, n)   Q( x, m, n)

Proof of Theorem nninfdclemcl

Dummy variables r s t are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nninfdclemf.a	. . . 4 |- ( ph -> A C_ NN )
2		nninfdclemcl.p	. . . 4 |- ( ph -> P e. A )
3	1, 2	sseldd 3226	. . 3 |- ( ph -> P e. NN )
4		nninfdclemcl.q	. . . 4 |- ( ph -> Q e. A )
5	1, 4	sseldd 3226	. . 3 |- ( ph -> Q e. NN )
6		inss1 3425	. . . . . 6 |- ( A i^i ( ZZ>= ` ( P + 1 ) ) ) C_ A
7	6, 1	sstrid 3236	. . . . 5 |- ( ph -> ( A i^i ( ZZ>= ` ( P + 1 ) ) ) C_ NN )
8		eleq1 2292	. . . . . . . . . . 11 |- ( x = s -> ( x e. A <-> s e. A ) )
9	8	dcbid 843	. . . . . . . . . 10 |- ( x = s -> (DECID x e. A <-> DECID s e. A ) )
10		nninfdclemf.dc	. . . . . . . . . . 11 |- ( ph -> A. x e. NN DECID x e. A )
11	10	adantr 276	. . . . . . . . . 10 |- ( ( ph /\ s e. NN ) -> A. x e. NN DECID x e. A )
12		simpr 110	. . . . . . . . . 10 |- ( ( ph /\ s e. NN ) -> s e. NN )
13	9, 11, 12	rspcdva 2913	. . . . . . . . 9 |- ( ( ph /\ s e. NN ) -> DECID s e. A )
14	3	adantr 276	. . . . . . . . . . . 12 |- ( ( ph /\ s e. NN ) -> P e. NN )
15	14	nnzd 9591	. . . . . . . . . . 11 |- ( ( ph /\ s e. NN ) -> P e. ZZ )
16	15	peano2zd 9595	. . . . . . . . . 10 |- ( ( ph /\ s e. NN ) -> ( P + 1 ) e. ZZ )
17	12	nnzd 9591	. . . . . . . . . 10 |- ( ( ph /\ s e. NN ) -> s e. ZZ )
18		eluzdc 9834	. . . . . . . . . 10 |- ( ( ( P + 1 ) e. ZZ /\ s e. ZZ ) -> DECID s e. ( ZZ>= ` ( P + 1 ) ) )
19	16, 17, 18	syl2anc 411	. . . . . . . . 9 |- ( ( ph /\ s e. NN ) -> DECID s e. ( ZZ>= ` ( P + 1 ) ) )
20	13, 19	dcand 938	. . . . . . . 8 |- ( ( ph /\ s e. NN ) -> DECID ( s e. A /\ s e. ( ZZ>= ` ( P + 1 ) ) ) )
21		elin 3388	. . . . . . . . 9 |- ( s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> ( s e. A /\ s e. ( ZZ>= ` ( P + 1 ) ) ) )
22	21	dcbii 845	. . . . . . . 8 |- (DECID s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> DECID ( s e. A /\ s e. ( ZZ>= ` ( P + 1 ) ) ) )
23	20, 22	sylibr 134	. . . . . . 7 |- ( ( ph /\ s e. NN ) -> DECID s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
24	23	ralrimiva 2603	. . . . . 6 |- ( ph -> A. s e. NN DECID s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
25		eleq1 2292	. . . . . . . 8 |- ( s = x -> ( s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> x e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) ) )
26	25	dcbid 843	. . . . . . 7 |- ( s = x -> (DECID s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> DECID x e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) ) )
27	26	cbvralvw 2769	. . . . . 6 |- ( A. s e. NN DECID s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> A. x e. NN DECID x e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
28	24, 27	sylib 122	. . . . 5 |- ( ph -> A. x e. NN DECID x e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
29		breq1 4089	. . . . . . . . 9 |- ( m = P -> ( m < n <-> P < n ) )
30	29	rexbidv 2531	. . . . . . . 8 |- ( m = P -> ( E. n e. A m < n <-> E. n e. A P < n ) )
31		nninfdclemf.nb	. . . . . . . 8 |- ( ph -> A. m e. NN E. n e. A m < n )
32	30, 31, 3	rspcdva 2913	. . . . . . 7 |- ( ph -> E. n e. A P < n )
33		breq2 4090	. . . . . . . 8 |- ( n = t -> ( P < n <-> P < t ) )
34	33	cbvrexvw 2770	. . . . . . 7 |- ( E. n e. A P < n <-> E. t e. A P < t )
35	32, 34	sylib 122	. . . . . 6 |- ( ph -> E. t e. A P < t )
36		simprl 529	. . . . . . . 8 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. A )
37	3	nnzd 9591	. . . . . . . . . . 11 |- ( ph -> P e. ZZ )
38	37	peano2zd 9595	. . . . . . . . . 10 |- ( ph -> ( P + 1 ) e. ZZ )
39	38	adantr 276	. . . . . . . . 9 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> ( P + 1 ) e. ZZ )
40	1	adantr 276	. . . . . . . . . . 11 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> A C_ NN )
41	40, 36	sseldd 3226	. . . . . . . . . 10 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. NN )
42	41	nnzd 9591	. . . . . . . . 9 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. ZZ )
43		simprr 531	. . . . . . . . . 10 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> P < t )
44		nnltp1le 9530	. . . . . . . . . . 11 |- ( ( P e. NN /\ t e. NN ) -> ( P < t <-> ( P + 1 ) <_ t ) )
45	3, 41, 44	syl2an2r 597	. . . . . . . . . 10 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> ( P < t <-> ( P + 1 ) <_ t ) )
46	43, 45	mpbid 147	. . . . . . . . 9 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> ( P + 1 ) <_ t )
47		eluz2 9751	. . . . . . . . 9 |- ( t e. ( ZZ>= ` ( P + 1 ) ) <-> ( ( P + 1 ) e. ZZ /\ t e. ZZ /\ ( P + 1 ) <_ t ) )
48	39, 42, 46, 47	syl3anbrc 1205	. . . . . . . 8 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. ( ZZ>= ` ( P + 1 ) ) )
49	36, 48	elind 3390	. . . . . . 7 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
50		elex2 2817	. . . . . . 7 |- ( t e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) -> E. r r e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
51	49, 50	syl 14	. . . . . 6 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> E. r r e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
52	35, 51	rexlimddv 2653	. . . . 5 |- ( ph -> E. r r e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
53		nnmindc 12595	. . . . 5 |- ( ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) C_ NN /\ A. x e. NN DECID x e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) /\ E. r r e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) ) -> inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
54	7, 28, 52, 53	syl3anc 1271	. . . 4 |- ( ph -> inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
55	54	elin1d 3394	. . 3 |- ( ph -> inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) e. A )
56		fvoveq1 6036	. . . . . 6 |- ( y = P -> ( ZZ>= ` ( y + 1 ) ) = ( ZZ>= ` ( P + 1 ) ) )
57	56	ineq2d 3406	. . . . 5 |- ( y = P -> ( A i^i ( ZZ>= ` ( y + 1 ) ) ) = ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
58	57	infeq1d 7202	. . . 4 |- ( y = P -> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) = inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) )
59		eqidd 2230	. . . 4 |- ( z = Q -> inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) = inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) )
60		eqid 2229	. . . 4 |- ( y e. NN , z e. NN |-> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) ) = ( y e. NN , z e. NN |-> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) )
61	58, 59, 60	ovmpog 6151	. . 3 |- ( ( P e. NN /\ Q e. NN /\ inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) e. A ) -> ( P ( y e. NN , z e. NN |-> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) ) Q ) = inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) )
62	3, 5, 55, 61	syl3anc 1271	. 2 |- ( ph -> ( P ( y e. NN , z e. NN |-> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) ) Q ) = inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) )
63	62, 55	eqeltrd 2306	1 |- ( ph -> ( P ( y e. NN , z e. NN |-> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) ) Q ) e. A )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 839   = wceq 1395   E.wex 1538   e. wcel 2200   A.wral 2508   E.wrex 2509   i^i cin 3197   C_ wss 3198   class class class wbr 4086   ` cfv 5324  (class class class)co 6013   e. cmpo 6015  infcinf 7173   RRcr 8021   1c1 8023   + caddc 8025   < clt 8204   <_ cle 8205   NNcn 9133   ZZcz 9469   ZZ>=cuz 9745

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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-isom 5333  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-sup 7174  df-inf 7175  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470  df-uz 9746  df-fz 10234  df-fzo 10368

This theorem is referenced by:  nninfdclemf  13060  nninfdclemp1  13061