geomcau - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > geomcau		Structured version Visualization version GIF version

Theorem geomcau 36615

Description: If the distance between consecutive points in a sequence is bounded by a geometric sequence, then the sequence is Cauchy. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 5-Jun-2014.)

**Hypotheses**
Ref	Expression
lmclim2.2	⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
lmclim2.3	⊢ (𝜑 → 𝐹:ℕ⟶𝑋)
geomcau.4	⊢ (𝜑 → 𝐴 ∈ ℝ)
geomcau.5	⊢ (𝜑 → 𝐵 ∈ ℝ⁺)
geomcau.6	⊢ (𝜑 → 𝐵 < 1)
geomcau.7	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (𝐵↑𝑘)))

**Assertion**
Ref	Expression
geomcau	⊢ (𝜑 → 𝐹 ∈ (Cau‘𝐷))

Distinct variable groups: 𝐷,𝑘 𝑘,𝐹 𝑘,𝑋 𝐴,𝑘 𝐵,𝑘 𝜑,𝑘

Proof of Theorem geomcau Dummy variables 𝑗 𝑛 𝑥 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnuz 12861	. . . . . 6 ⊢ ℕ = (ℤ_≥‘1)
2		1zzd 12589	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℤ)
3		geomcau.5	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ⁺)
4	3	rpcnd 13014	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ)
5	3	rpred 13012	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ)
6	3	rpge0d 13016	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ 𝐵)
7	5, 6	absidd 15365	. . . . . . . 8 ⊢ (𝜑 → (abs‘𝐵) = 𝐵)
8		geomcau.6	. . . . . . . 8 ⊢ (𝜑 → 𝐵 < 1)
9	7, 8	eqbrtrd 5169	. . . . . . 7 ⊢ (𝜑 → (abs‘𝐵) < 1)
10	4, 9	expcnv 15806	. . . . . 6 ⊢ (𝜑 → (𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚)) ⇝ 0)
11		geomcau.4	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
12		1re 11210	. . . . . . . . . 10 ⊢ 1 ∈ ℝ
13		resubcl 11520	. . . . . . . . . 10 ⊢ ((1 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (1 − 𝐵) ∈ ℝ)
14	12, 5, 13	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → (1 − 𝐵) ∈ ℝ)
15		posdif 11703	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ ∧ 1 ∈ ℝ) → (𝐵 < 1 ↔ 0 < (1 − 𝐵)))
16	5, 12, 15	sylancl 586	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 < 1 ↔ 0 < (1 − 𝐵)))
17	8, 16	mpbid 231	. . . . . . . . 9 ⊢ (𝜑 → 0 < (1 − 𝐵))
18	14, 17	elrpd 13009	. . . . . . . 8 ⊢ (𝜑 → (1 − 𝐵) ∈ ℝ⁺)
19	11, 18	rerpdivcld 13043	. . . . . . 7 ⊢ (𝜑 → (𝐴 / (1 − 𝐵)) ∈ ℝ)
20	19	recnd 11238	. . . . . 6 ⊢ (𝜑 → (𝐴 / (1 − 𝐵)) ∈ ℂ)
21		nnex 12214	. . . . . . . 8 ⊢ ℕ ∈ V
22	21	mptex 7221	. . . . . . 7 ⊢ (𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵)))) ∈ V
23	22	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵)))) ∈ V)
24		nnnn0 12475	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ₀)
25	24	adantl 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ₀)
26		oveq2 7413	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (𝐵↑𝑚) = (𝐵↑𝑛))
27		eqid 2732	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚)) = (𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚))
28		ovex 7438	. . . . . . . . 9 ⊢ (𝐵↑𝑛) ∈ V
29	26, 27, 28	fvmpt 6995	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ₀ → ((𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚))‘𝑛) = (𝐵↑𝑛))
30	25, 29	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚))‘𝑛) = (𝐵↑𝑛))
31		nnz 12575	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℤ)
32		rpexpcl 14042	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ⁺ ∧ 𝑛 ∈ ℤ) → (𝐵↑𝑛) ∈ ℝ⁺)
33	3, 31, 32	syl2an 596	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐵↑𝑛) ∈ ℝ⁺)
34	33	rpcnd 13014	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐵↑𝑛) ∈ ℂ)
35	30, 34	eqeltrd 2833	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚))‘𝑛) ∈ ℂ)
36	20	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐴 / (1 − 𝐵)) ∈ ℂ)
37	34, 36	mulcomd 11231	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐵↑𝑛) · (𝐴 / (1 − 𝐵))) = ((𝐴 / (1 − 𝐵)) · (𝐵↑𝑛)))
38	26	oveq1d 7420	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵))) = ((𝐵↑𝑛) · (𝐴 / (1 − 𝐵))))
39		eqid 2732	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵)))) = (𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵))))
40		ovex 7438	. . . . . . . . 9 ⊢ ((𝐵↑𝑛) · (𝐴 / (1 − 𝐵))) ∈ V
41	38, 39, 40	fvmpt 6995	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ((𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵))))‘𝑛) = ((𝐵↑𝑛) · (𝐴 / (1 − 𝐵))))
42	41	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵))))‘𝑛) = ((𝐵↑𝑛) · (𝐴 / (1 − 𝐵))))
43	30	oveq2d 7421	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐴 / (1 − 𝐵)) · ((𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚))‘𝑛)) = ((𝐴 / (1 − 𝐵)) · (𝐵↑𝑛)))
44	37, 42, 43	3eqtr4d 2782	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵))))‘𝑛) = ((𝐴 / (1 − 𝐵)) · ((𝑚 ∈ ℕ₀ ↦ (𝐵↑𝑚))‘𝑛)))
45	1, 2, 10, 20, 23, 35, 44	climmulc2 15577	. . . . 5 ⊢ (𝜑 → (𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵)))) ⇝ ((𝐴 / (1 − 𝐵)) · 0))
46	20	mul01d 11409	. . . . 5 ⊢ (𝜑 → ((𝐴 / (1 − 𝐵)) · 0) = 0)
47	45, 46	breqtrd 5173	. . . 4 ⊢ (𝜑 → (𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵)))) ⇝ 0)
48	33	rpred 13012	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐵↑𝑛) ∈ ℝ)
49	19	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐴 / (1 − 𝐵)) ∈ ℝ)
50	48, 49	remulcld 11240	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐵↑𝑛) · (𝐴 / (1 − 𝐵))) ∈ ℝ)
51	50	recnd 11238	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐵↑𝑛) · (𝐴 / (1 − 𝐵))) ∈ ℂ)
52	1, 2, 23, 42, 51	clim0c 15447	. . . 4 ⊢ (𝜑 → ((𝑚 ∈ ℕ ↦ ((𝐵↑𝑚) · (𝐴 / (1 − 𝐵)))) ⇝ 0 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥))
53	47, 52	mpbid 231	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥)
54		nnz 12575	. . . . . . . 8 ⊢ (𝑗 ∈ ℕ → 𝑗 ∈ ℤ)
55	54	adantl 482	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ ℕ) → 𝑗 ∈ ℤ)
56		uzid 12833	. . . . . . 7 ⊢ (𝑗 ∈ ℤ → 𝑗 ∈ (ℤ_≥‘𝑗))
57		oveq2 7413	. . . . . . . . . 10 ⊢ (𝑛 = 𝑗 → (𝐵↑𝑛) = (𝐵↑𝑗))
58	57	fvoveq1d 7427	. . . . . . . . 9 ⊢ (𝑛 = 𝑗 → (abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) = (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))))
59	58	breq1d 5157	. . . . . . . 8 ⊢ (𝑛 = 𝑗 → ((abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥 ↔ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥))
60	59	rspcv 3608	. . . . . . 7 ⊢ (𝑗 ∈ (ℤ_≥‘𝑗) → (∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥 → (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥))
61	55, 56, 60	3syl 18	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ ℕ) → (∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥 → (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥))
62		lmclim2.2	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
63	62	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝐷 ∈ (Met‘𝑋))
64		lmclim2.3	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹:ℕ⟶𝑋)
65		simpl 483	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑗 ∈ ℕ)
66		ffvelcdm 7080	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℕ⟶𝑋 ∧ 𝑗 ∈ ℕ) → (𝐹‘𝑗) ∈ 𝑋)
67	64, 65, 66	syl2an 596	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑗) ∈ 𝑋)
68		eluznn 12898	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑛 ∈ ℕ)
69		ffvelcdm 7080	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℕ⟶𝑋 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) ∈ 𝑋)
70	64, 68, 69	syl2an 596	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝐹‘𝑛) ∈ 𝑋)
71		metcl 23829	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑗) ∈ 𝑋 ∧ (𝐹‘𝑛) ∈ 𝑋) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ∈ ℝ)
72	63, 67, 70, 71	syl3anc 1371	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ∈ ℝ)
73		eqid 2732	. . . . . . . . . . . . 13 ⊢ (ℤ_≥‘𝑗) = (ℤ_≥‘𝑗)
74		nnnn0 12475	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ ℕ → 𝑗 ∈ ℕ₀)
75	74	ad2antrl 726	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ ℕ₀)
76	75	nn0zd 12580	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ ℤ)
77		oveq2 7413	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = 𝑘 → (𝐵↑𝑚) = (𝐵↑𝑘))
78	77	oveq2d 7421	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑘 → (𝐴 · (𝐵↑𝑚)) = (𝐴 · (𝐵↑𝑘)))
79		eqid 2732	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚))) = (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))
80		ovex 7438	. . . . . . . . . . . . . . 15 ⊢ (𝐴 · (𝐵↑𝑘)) ∈ V
81	78, 79, 80	fvmpt 6995	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (ℤ_≥‘𝑗) → ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))‘𝑘) = (𝐴 · (𝐵↑𝑘)))
82	81	adantl 482	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))‘𝑘) = (𝐴 · (𝐵↑𝑘)))
83	11	ad2antrr 724	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝐴 ∈ ℝ)
84	5	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝐵 ∈ ℝ)
85		eluznn0 12897	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑗 ∈ ℕ₀ ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ₀)
86	75, 85	sylan 580	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ₀)
87	84, 86	reexpcld 14124	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐵↑𝑘) ∈ ℝ)
88	83, 87	remulcld 11240	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐴 · (𝐵↑𝑘)) ∈ ℝ)
89	88	recnd 11238	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐴 · (𝐵↑𝑘)) ∈ ℂ)
90	11	recnd 11238	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐴 ∈ ℂ)
91	90	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝐴 ∈ ℂ)
92	4	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝐵 ∈ ℂ)
93	9	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘𝐵) < 1)
94		eqid 2732	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚)) = (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚))
95		ovex 7438	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵↑𝑘) ∈ V
96	77, 94, 95	fvmpt 6995	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (ℤ_≥‘𝑗) → ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚))‘𝑘) = (𝐵↑𝑘))
97	96	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚))‘𝑘) = (𝐵↑𝑘))
98	92, 93, 75, 97	geolim2 15813	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑗( + , (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚))) ⇝ ((𝐵↑𝑗) / (1 − 𝐵)))
99	87	recnd 11238	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐵↑𝑘) ∈ ℂ)
100	97, 99	eqeltrd 2833	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚))‘𝑘) ∈ ℂ)
101	97	oveq2d 7421	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐴 · ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚))‘𝑘)) = (𝐴 · (𝐵↑𝑘)))
102	82, 101	eqtr4d 2775	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))‘𝑘) = (𝐴 · ((𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐵↑𝑚))‘𝑘)))
103	73, 76, 91, 98, 100, 102	isermulc2 15600	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑗( + , (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))) ⇝ (𝐴 · ((𝐵↑𝑗) / (1 − 𝐵))))
104	3	adantr 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝐵 ∈ ℝ⁺)
105	104, 76	rpexpcld 14206	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝐵↑𝑗) ∈ ℝ⁺)
106	105	rpcnd 13014	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝐵↑𝑗) ∈ ℂ)
107	14	recnd 11238	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1 − 𝐵) ∈ ℂ)
108	107	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (1 − 𝐵) ∈ ℂ)
109	18	rpne0d 13017	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1 − 𝐵) ≠ 0)
110	109	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (1 − 𝐵) ≠ 0)
111	91, 106, 108, 110	div12d 12022	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝐴 · ((𝐵↑𝑗) / (1 − 𝐵))) = ((𝐵↑𝑗) · (𝐴 / (1 − 𝐵))))
112	103, 111	breqtrd 5173	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑗( + , (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))) ⇝ ((𝐵↑𝑗) · (𝐴 / (1 − 𝐵))))
113	73, 76, 82, 89, 112	isumclim 15699	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (ℤ_≥‘𝑗)(𝐴 · (𝐵↑𝑘)) = ((𝐵↑𝑗) · (𝐴 / (1 − 𝐵))))
114		seqex 13964	. . . . . . . . . . . . . . 15 ⊢ seq𝑗( + , (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))) ∈ V
115		ovex 7438	. . . . . . . . . . . . . . 15 ⊢ (𝐴 · ((𝐵↑𝑗) / (1 − 𝐵))) ∈ V
116	114, 115	breldm 5906	. . . . . . . . . . . . . 14 ⊢ (seq𝑗( + , (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))) ⇝ (𝐴 · ((𝐵↑𝑗) / (1 − 𝐵))) → seq𝑗( + , (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))) ∈ dom ⇝ )
117	103, 116	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑗( + , (𝑚 ∈ (ℤ_≥‘𝑗) ↦ (𝐴 · (𝐵↑𝑚)))) ∈ dom ⇝ )
118	73, 76, 82, 88, 117	isumrecl 15707	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (ℤ_≥‘𝑗)(𝐴 · (𝐵↑𝑘)) ∈ ℝ)
119	113, 118	eqeltrrd 2834	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐵↑𝑗) · (𝐴 / (1 − 𝐵))) ∈ ℝ)
120	119	recnd 11238	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐵↑𝑗) · (𝐴 / (1 − 𝐵))) ∈ ℂ)
121	120	abscld 15379	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) ∈ ℝ)
122		fzfid 13934	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑗...(𝑛 − 1)) ∈ Fin)
123		simpll 765	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑗...(𝑛 − 1))) → 𝜑)
124		elfzuz 13493	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (𝑗...(𝑛 − 1)) → 𝑘 ∈ (ℤ_≥‘𝑗))
125		simprl 769	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ ℕ)
126		eluznn 12898	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑗 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
127	125, 126	sylan 580	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ ℕ)
128	124, 127	sylan2 593	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑗...(𝑛 − 1))) → 𝑘 ∈ ℕ)
129	62	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐷 ∈ (Met‘𝑋))
130	64	ffvelcdmda 7083	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ 𝑋)
131		peano2nn 12220	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ)
132		ffvelcdm 7080	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹:ℕ⟶𝑋 ∧ (𝑘 + 1) ∈ ℕ) → (𝐹‘(𝑘 + 1)) ∈ 𝑋)
133	64, 131, 132	syl2an 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘(𝑘 + 1)) ∈ 𝑋)
134		metcl 23829	. . . . . . . . . . . . . . . 16 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ (𝐹‘(𝑘 + 1)) ∈ 𝑋) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
135	129, 130, 133, 134	syl3anc 1371	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
136	123, 128, 135	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑗...(𝑛 − 1))) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
137	122, 136	fsumrecl 15676	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑗...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
138		simprr 771	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑛 ∈ (ℤ_≥‘𝑗))
139		elfzuz 13493	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (𝑗...𝑛) → 𝑘 ∈ (ℤ_≥‘𝑗))
140		simpll 765	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝜑)
141	140, 127, 130	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ 𝑋)
142	139, 141	sylan2 593	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑗...𝑛)) → (𝐹‘𝑘) ∈ 𝑋)
143	63, 138, 142	mettrifi 36613	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑗...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
144	124, 88	sylan2 593	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑗...(𝑛 − 1))) → (𝐴 · (𝐵↑𝑘)) ∈ ℝ)
145	122, 144	fsumrecl 15676	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑗...(𝑛 − 1))(𝐴 · (𝐵↑𝑘)) ∈ ℝ)
146		geomcau.7	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (𝐵↑𝑘)))
147	123, 128, 146	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑗...(𝑛 − 1))) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (𝐵↑𝑘)))
148	122, 136, 144, 147	fsumle 15741	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑗...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ≤ Σ𝑘 ∈ (𝑗...(𝑛 − 1))(𝐴 · (𝐵↑𝑘)))
149		fzssuz 13538	. . . . . . . . . . . . . . . 16 ⊢ (𝑗...(𝑛 − 1)) ⊆ (ℤ_≥‘𝑗)
150	149	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑗...(𝑛 − 1)) ⊆ (ℤ_≥‘𝑗))
151		0red 11213	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ∈ ℝ)
152		nnz 12575	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℤ)
153		rpexpcl 14042	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐵 ∈ ℝ⁺ ∧ 𝑘 ∈ ℤ) → (𝐵↑𝑘) ∈ ℝ⁺)
154	3, 152, 153	syl2an 596	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐵↑𝑘) ∈ ℝ⁺)
155	135, 154	rerpdivcld 13043	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) / (𝐵↑𝑘)) ∈ ℝ)
156	11	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℝ)
157		metge0 23842	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ (𝐹‘(𝑘 + 1)) ∈ 𝑋) → 0 ≤ ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
158	129, 130, 133, 157	syl3anc 1371	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
159	135, 154, 158	divge0d 13052	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ (((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) / (𝐵↑𝑘)))
160	135, 156, 154	ledivmul2d 13066	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) / (𝐵↑𝑘)) ≤ 𝐴 ↔ ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ≤ (𝐴 · (𝐵↑𝑘))))
161	146, 160	mpbird 256	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) / (𝐵↑𝑘)) ≤ 𝐴)
162	151, 155, 156, 159, 161	letrd 11367	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ 𝐴)
163	140, 127, 162	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 0 ≤ 𝐴)
164	140, 127, 154	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐵↑𝑘) ∈ ℝ⁺)
165	164	rpge0d 13016	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 0 ≤ (𝐵↑𝑘))
166	83, 87, 163, 165	mulge0d 11787	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 0 ≤ (𝐴 · (𝐵↑𝑘)))
167	73, 76, 122, 150, 82, 88, 166, 117	isumless 15787	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑗...(𝑛 − 1))(𝐴 · (𝐵↑𝑘)) ≤ Σ𝑘 ∈ (ℤ_≥‘𝑗)(𝐴 · (𝐵↑𝑘)))
168	137, 145, 118, 148, 167	letrd 11367	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑗...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ≤ Σ𝑘 ∈ (ℤ_≥‘𝑗)(𝐴 · (𝐵↑𝑘)))
169	72, 137, 118, 143, 168	letrd 11367	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (ℤ_≥‘𝑗)(𝐴 · (𝐵↑𝑘)))
170	169, 113	breqtrd 5173	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ≤ ((𝐵↑𝑗) · (𝐴 / (1 − 𝐵))))
171	119	leabsd 15357	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐵↑𝑗) · (𝐴 / (1 − 𝐵))) ≤ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))))
172	72, 119, 121, 170, 171	letrd 11367	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ≤ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))))
173	172	adantlr 713	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ≤ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))))
174	72	adantlr 713	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ∈ ℝ)
175	121	adantlr 713	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) ∈ ℝ)
176		rpre 12978	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
177	176	ad2antlr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑥 ∈ ℝ)
178		lelttr 11300	. . . . . . . . . 10 ⊢ ((((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ∈ ℝ ∧ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ≤ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) ∧ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
179	174, 175, 177, 178	syl3anc 1371	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((((𝐹‘𝑗)𝐷(𝐹‘𝑛)) ≤ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) ∧ (abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥) → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
180	173, 179	mpand 693	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥 → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
181	180	anassrs 468	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → ((abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥 → ((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
182	181	ralrimdva 3154	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ ℕ) → ((abs‘((𝐵↑𝑗) · (𝐴 / (1 − 𝐵)))) < 𝑥 → ∀𝑛 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
183	61, 182	syld 47	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ ℕ) → (∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥 → ∀𝑛 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
184	183	reximdva 3168	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥 → ∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
185	184	ralimdva 3167	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((𝐵↑𝑛) · (𝐴 / (1 − 𝐵)))) < 𝑥 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
186	53, 185	mpd 15	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥)
187		metxmet 23831	. . . 4 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
188	62, 187	syl 17	. . 3 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝑋))
189		eqidd 2733	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) = (𝐹‘𝑛))
190		eqidd 2733	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐹‘𝑗) = (𝐹‘𝑗))
191	1, 188, 2, 189, 190, 64	iscauf 24788	. 2 ⊢ (𝜑 → (𝐹 ∈ (Cau‘𝐷) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℕ ∀𝑛 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑗)𝐷(𝐹‘𝑛)) < 𝑥))
192	186, 191	mpbird 256	1 ⊢ (𝜑 → 𝐹 ∈ (Cau‘𝐷))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ⊆ wss 3947 class class class wbr 5147 ↦ cmpt 5230 dom cdm 5675 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 + caddc 11109 · cmul 11111 < clt 11244 ≤ cle 11245 − cmin 11440 / cdiv 11867 ℕcn 12208 ℕ₀cn0 12468 ℤcz 12554 ℤ_≥cuz 12818 ℝ⁺crp 12970 ...cfz 13480 seqcseq 13962 ↑cexp 14023 abscabs 15177 ⇝ cli 15424 Σcsu 15628 ∞Metcxmet 20921 Metcmet 20922 Cauccau 24761

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-sup 9433 df-inf 9434 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-z 12555 df-uz 12819 df-rp 12971 df-xneg 13088 df-xadd 13089 df-xmul 13090 df-ico 13326 df-fz 13481 df-fzo 13624 df-fl 13753 df-seq 13963 df-exp 14024 df-hash 14287 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-clim 15428 df-rlim 15429 df-sum 15629 df-psmet 20928 df-xmet 20929 df-met 20930 df-bl 20931 df-cau 24764

This theorem is referenced by: bfplem1 36678

W3C validator