Theorem nninfdclemcl 13339

Description: Lemma for nninfdc 13344. (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 3249	. . 3 |- ( ph -> P e. NN )
4		nninfdclemcl.q	. . . 4 |- ( ph -> Q e. A )
5	1, 4	sseldd 3249	. . 3 |- ( ph -> Q e. NN )
6		inss1 3451	. . . . . 6 |- ( A i^i ( ZZ>= ` ( P + 1 ) ) ) C_ A
7	6, 1	sstrid 3259	. . . . 5 |- ( ph -> ( A i^i ( ZZ>= ` ( P + 1 ) ) ) C_ NN )
8		eleq1 2301	. . . . . . . . . . 11 |- ( x = s -> ( x e. A <-> s e. A ) )
9	8	dcbid 850	. . . . . . . . . 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 2934	. . . . . . . . 9 |- ( ( ph /\ s e. NN ) -> DECID s e. A )
14	3	adantr 276	. . . . . . . . . . . 12 |- ( ( ph /\ s e. NN ) -> P e. NN )
15	14	nnzd 9767	. . . . . . . . . . 11 |- ( ( ph /\ s e. NN ) -> P e. ZZ )
16	15	peano2zd 9771	. . . . . . . . . 10 |- ( ( ph /\ s e. NN ) -> ( P + 1 ) e. ZZ )
17	12	nnzd 9767	. . . . . . . . . 10 |- ( ( ph /\ s e. NN ) -> s e. ZZ )
18		eluzdc 10010	. . . . . . . . . 10 |- ( ( ( P + 1 ) e. ZZ /\ s e. ZZ ) -> DECID s e. ( ZZ>= ` ( P + 1 ) ) )
19	16, 17, 18	syl2anc 415	. . . . . . . . 9 |- ( ( ph /\ s e. NN ) -> DECID s e. ( ZZ>= ` ( P + 1 ) ) )
20	13, 19	dcand 945	. . . . . . . 8 |- ( ( ph /\ s e. NN ) -> DECID ( s e. A /\ s e. ( ZZ>= ` ( P + 1 ) ) ) )
21		elin 3412	. . . . . . . . 9 |- ( s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> ( s e. A /\ s e. ( ZZ>= ` ( P + 1 ) ) ) )
22	21	dcbii 852	. . . . . . . 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 2623	. . . . . 6 |- ( ph -> A. s e. NN DECID s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
25		eleq1 2301	. . . . . . . 8 |- ( s = x -> ( s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> x e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) ) )
26	25	dcbid 850	. . . . . . 7 |- ( s = x -> (DECID s e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) <-> DECID x e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) ) )
27	26	cbvralvw 2790	. . . . . 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 4133	. . . . . . . . 9 |- ( m = P -> ( m < n <-> P < n ) )
30	29	rexbidv 2551	. . . . . . . 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 2934	. . . . . . 7 |- ( ph -> E. n e. A P < n )
33		breq2 4134	. . . . . . . 8 |- ( n = t -> ( P < n <-> P < t ) )
34	33	cbvrexvw 2791	. . . . . . 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 535	. . . . . . . 8 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. A )
37	3	nnzd 9767	. . . . . . . . . . 11 |- ( ph -> P e. ZZ )
38	37	peano2zd 9771	. . . . . . . . . 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 3249	. . . . . . . . . 10 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. NN )
42	41	nnzd 9767	. . . . . . . . 9 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. ZZ )
43		simprr 537	. . . . . . . . . 10 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> P < t )
44		nnltp1le 9705	. . . . . . . . . . 11 |- ( ( P e. NN /\ t e. NN ) -> ( P < t <-> ( P + 1 ) <_ t ) )
45	3, 41, 44	syl2an2r 603	. . . . . . . . . 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 9927	. . . . . . . . 9 |- ( t e. ( ZZ>= ` ( P + 1 ) ) <-> ( ( P + 1 ) e. ZZ /\ t e. ZZ /\ ( P + 1 ) <_ t ) )
48	39, 42, 46, 47	syl3anbrc 1212	. . . . . . . 8 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. ( ZZ>= ` ( P + 1 ) ) )
49	36, 48	elind 3414	. . . . . . 7 |- ( ( ph /\ ( t e. A /\ P < t ) ) -> t e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
50		elex2 2838	. . . . . . 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 2673	. . . . 5 |- ( ph -> E. r r e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
53		nnmindc 12811	. . . . 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 1278	. . . 4 |- ( ph -> inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) e. ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
55	54	elin1d 3418	. . 3 |- ( ph -> inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) e. A )
56		fvoveq1 6108	. . . . . 6 |- ( y = P -> ( ZZ>= ` ( y + 1 ) ) = ( ZZ>= ` ( P + 1 ) ) )
57	56	ineq2d 3432	. . . . 5 |- ( y = P -> ( A i^i ( ZZ>= ` ( y + 1 ) ) ) = ( A i^i ( ZZ>= ` ( P + 1 ) ) ) )
58	57	infeq1d 7352	. . . 4 |- ( y = P -> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) = inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) )
59		eqidd 2239	. . . 4 |- ( z = Q -> inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) = inf ( ( A i^i ( ZZ>= ` ( P + 1 ) ) ) , RR , < ) )
60		eqid 2238	. . . 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 6223	. . 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 1278	. 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 2315	1 |- ( ph -> ( P ( y e. NN , z e. NN |-> inf ( ( A i^i ( ZZ>= ` ( y + 1 ) ) ) , RR , < ) ) Q ) e. A )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 846   = wceq 1402   E.wex 1545   e. wcel 2209   A.wral 2528   E.wrex 2529   i^i cin 3219   C_ wss 3220   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   e. cmpo 6087  infcinf 7323   RRcr 8178   1c1 8180   + caddc 8182   < clt 8360   <_ cle 8361   NNcn 9304   ZZcz 9644   ZZ>=cuz 9921

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  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-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-fzo 10550

This theorem is used by:  nninfdclemf  13340  nninfdclemp1  13341