ntrivcvgap - Intuitionistic Logic Explorer

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

Theorem ntrivcvgap 11569

Description: A non-trivially converging infinite product converges. (Contributed by Scott Fenton, 18-Dec-2017.)

**Hypotheses**
Ref	Expression
ntrivcvg.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
ntrivcvgap.2	⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))
ntrivcvg.3	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)

**Assertion**
Ref	Expression
ntrivcvgap	⊢ (𝜑 → seq𝑀( · , 𝐹) ∈ dom ⇝ )

Distinct variable groups: 𝑘,𝐹,𝑛,𝑦 𝑘,𝑀,𝑛,𝑦 𝑘,𝑍,𝑦 𝜑,𝑘,𝑛,𝑦 Allowed substitution hint: 𝑍(𝑛)

**Proof of Theorem ntrivcvgap**
Step	Hyp	Ref	Expression
1		ntrivcvgap.2	. 2 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))
2		uzm1 9571	. . . . . . . . 9 ⊢ (𝑛 ∈ (ℤ_≥‘𝑀) → (𝑛 = 𝑀 ∨ (𝑛 − 1) ∈ (ℤ_≥‘𝑀)))
3		ntrivcvg.1	. . . . . . . . 9 ⊢ 𝑍 = (ℤ_≥‘𝑀)
4	2, 3	eleq2s 2282	. . . . . . . 8 ⊢ (𝑛 ∈ 𝑍 → (𝑛 = 𝑀 ∨ (𝑛 − 1) ∈ (ℤ_≥‘𝑀)))
5	4	ad2antlr 489	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → (𝑛 = 𝑀 ∨ (𝑛 − 1) ∈ (ℤ_≥‘𝑀)))
6		seqeq1 10461	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑀 → seq𝑛( · , 𝐹) = seq𝑀( · , 𝐹))
7	6	breq1d 4025	. . . . . . . . . 10 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑀( · , 𝐹) ⇝ 𝑦))
8		seqex 10460	. . . . . . . . . . 11 ⊢ seq𝑀( · , 𝐹) ∈ V
9		vex 2752	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
10	8, 9	breldm 4843	. . . . . . . . . 10 ⊢ (seq𝑀( · , 𝐹) ⇝ 𝑦 → seq𝑀( · , 𝐹) ∈ dom ⇝ )
11	7, 10	biimtrdi 163	. . . . . . . . 9 ⊢ (𝑛 = 𝑀 → (seq𝑛( · , 𝐹) ⇝ 𝑦 → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
12	11	adantld 278	. . . . . . . 8 ⊢ (𝑛 = 𝑀 → (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
13		eluzel2 9546	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
14	13, 3	eleq2s 2282	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ 𝑍 → 𝑀 ∈ ℤ)
15	14	ad3antlr 493	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → 𝑀 ∈ ℤ)
16		ntrivcvg.3	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
17	16	ad5ant15 521	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
18	3, 15, 17	prodf 11559	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹):𝑍⟶ℂ)
19		simplr 528	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → (𝑛 − 1) ∈ 𝑍)
20	18, 19	ffvelcdmd 5665	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → (seq𝑀( · , 𝐹)‘(𝑛 − 1)) ∈ ℂ)
21		climcl 11303	. . . . . . . . . . . . . 14 ⊢ (seq𝑛( · , 𝐹) ⇝ 𝑦 → 𝑦 ∈ ℂ)
22	21	adantl 277	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → 𝑦 ∈ ℂ)
23	20, 22	mulcld 7991	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → ((seq𝑀( · , 𝐹)‘(𝑛 − 1)) · 𝑦) ∈ ℂ)
24		uzssz 9560	. . . . . . . . . . . . . . . . . . . 20 ⊢ (ℤ_≥‘𝑀) ⊆ ℤ
25	3, 24	eqsstri 3199	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝑍 ⊆ ℤ
26		simplr 528	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) → 𝑛 ∈ 𝑍)
27	25, 26	sselid 3165	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) → 𝑛 ∈ ℤ)
28	27	zcnd 9389	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) → 𝑛 ∈ ℂ)
29		1cnd 7986	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) → 1 ∈ ℂ)
30	28, 29	npcand 8285	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) → ((𝑛 − 1) + 1) = 𝑛)
31	30	seqeq1d 10464	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) → seq((𝑛 − 1) + 1)( · , 𝐹) = seq𝑛( · , 𝐹))
32	31	breq1d 4025	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) → (seq((𝑛 − 1) + 1)( · , 𝐹) ⇝ 𝑦 ↔ seq𝑛( · , 𝐹) ⇝ 𝑦))
33	32	biimpar 297	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq((𝑛 − 1) + 1)( · , 𝐹) ⇝ 𝑦)
34	3, 19, 17, 33	clim2prod 11560	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ⇝ ((seq𝑀( · , 𝐹)‘(𝑛 − 1)) · 𝑦))
35		breldmg 4845	. . . . . . . . . . . 12 ⊢ ((seq𝑀( · , 𝐹) ∈ V ∧ ((seq𝑀( · , 𝐹)‘(𝑛 − 1)) · 𝑦) ∈ ℂ ∧ seq𝑀( · , 𝐹) ⇝ ((seq𝑀( · , 𝐹)‘(𝑛 − 1)) · 𝑦)) → seq𝑀( · , 𝐹) ∈ dom ⇝ )
36	8, 23, 34, 35	mp3an2i 1352	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ (𝑛 − 1) ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ )
37	36	an32s 568	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ (𝑛 − 1) ∈ 𝑍) → seq𝑀( · , 𝐹) ∈ dom ⇝ )
38	37	expcom 116	. . . . . . . . 9 ⊢ ((𝑛 − 1) ∈ 𝑍 → (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
39	3	eqcomi 2191	. . . . . . . . 9 ⊢ (ℤ_≥‘𝑀) = 𝑍
40	38, 39	eleq2s 2282	. . . . . . . 8 ⊢ ((𝑛 − 1) ∈ (ℤ_≥‘𝑀) → (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
41	12, 40	jaoi 717	. . . . . . 7 ⊢ ((𝑛 = 𝑀 ∨ (𝑛 − 1) ∈ (ℤ_≥‘𝑀)) → (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
42	5, 41	mpcom 36	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ )
43	42	ex 115	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑛( · , 𝐹) ⇝ 𝑦 → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
44	43	adantld 278	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
45	44	exlimdv 1829	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
46	45	rexlimdva 2604	. 2 ⊢ (𝜑 → (∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 # 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) → seq𝑀( · , 𝐹) ∈ dom ⇝ ))
47	1, 46	mpd 13	1 ⊢ (𝜑 → seq𝑀( · , 𝐹) ∈ dom ⇝ )

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ∨ wo 709 = wceq 1363 ∃wex 1502 ∈ wcel 2158 ∃wrex 2466 Vcvv 2749 class class class wbr 4015 dom cdm 4638 ‘cfv 5228 (class class class)co 5888 ℂcc 7822 0cc0 7824 1c1 7825 + caddc 7827 · cmul 7829 − cmin 8141 # cap 8551 ℤcz 9266 ℤ_≥cuz 9541 seqcseq 10458 ⇝ cli 11299

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 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-nul 4141 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-iinf 4599 ax-cnex 7915 ax-resscn 7916 ax-1cn 7917 ax-1re 7918 ax-icn 7919 ax-addcl 7920 ax-addrcl 7921 ax-mulcl 7922 ax-mulrcl 7923 ax-addcom 7924 ax-mulcom 7925 ax-addass 7926 ax-mulass 7927 ax-distr 7928 ax-i2m1 7929 ax-0lt1 7930 ax-1rid 7931 ax-0id 7932 ax-rnegex 7933 ax-precex 7934 ax-cnre 7935 ax-pre-ltirr 7936 ax-pre-ltwlin 7937 ax-pre-lttrn 7938 ax-pre-apti 7939 ax-pre-ltadd 7940 ax-pre-mulgt0 7941 ax-pre-mulext 7942 ax-arch 7943 ax-caucvg 7944

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rmo 2473 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-nul 3435 df-if 3547 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-tr 4114 df-id 4305 df-po 4308 df-iso 4309 df-iord 4378 df-on 4380 df-ilim 4381 df-suc 4383 df-iom 4602 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-1st 6154 df-2nd 6155 df-recs 6319 df-frec 6405 df-pnf 8007 df-mnf 8008 df-xr 8009 df-ltxr 8010 df-le 8011 df-sub 8143 df-neg 8144 df-reap 8545 df-ap 8552 df-div 8643 df-inn 8933 df-2 8991 df-3 8992 df-4 8993 df-n0 9190 df-z 9267 df-uz 9542 df-rp 9667 df-seqfrec 10459 df-exp 10533 df-cj 10864 df-re 10865 df-im 10866 df-rsqrt 11020 df-abs 11021 df-clim 11300

This theorem is referenced by: (None)

W3C validator