Theorem cauappcvgprlem2 7690

Description: Lemma for cauappcvgpr 7692. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 23-Jun-2020.)

Hypotheses

Ref	Expression
cauappcvgpr.f	⊢ (𝜑 → 𝐹:Q⟶Q)
cauappcvgpr.app	⊢ (𝜑 → ∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))))
cauappcvgpr.bnd	⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
cauappcvgpr.lim	⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩
cauappcvgprlem.q	⊢ (𝜑 → 𝑄 ∈ Q)
cauappcvgprlem.r	⊢ (𝜑 → 𝑅 ∈ Q)

Assertion

Ref	Expression
cauappcvgprlem2	⊢ (𝜑 → 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩)

Distinct variable groups:   𝐴,𝑝   𝐿,𝑝,𝑞   𝜑,𝑝,𝑞   𝐹,𝑝,𝑞,𝑙,𝑢   𝑄,𝑝,𝑞,𝑙,𝑢   𝑅,𝑝,𝑞,𝑙,𝑢

Allowed substitution hints:   𝜑(𝑢,𝑙)   𝐴(𝑢,𝑞,𝑙)   𝐿(𝑢,𝑙)

Proof of Theorem cauappcvgprlem2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cauappcvgprlem.q	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ Q)
2		cauappcvgprlem.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Q)
3		ltaddnq 7437	. . . . 5 ⊢ ((𝑄 ∈ Q ∧ 𝑅 ∈ Q) → 𝑄 <Q (𝑄 +Q 𝑅))
4	1, 2, 3	syl2anc 411	. . . 4 ⊢ (𝜑 → 𝑄 <Q (𝑄 +Q 𝑅))
5		cauappcvgpr.f	. . . . 5 ⊢ (𝜑 → 𝐹:Q⟶Q)
6	5, 1	ffvelcdmd 5673	. . . 4 ⊢ (𝜑 → (𝐹‘𝑄) ∈ Q)
7		ltanqi 7432	. . . 4 ⊢ ((𝑄 <Q (𝑄 +Q 𝑅) ∧ (𝐹‘𝑄) ∈ Q) → ((𝐹‘𝑄) +Q 𝑄) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)))
8	4, 6, 7	syl2anc 411	. . 3 ⊢ (𝜑 → ((𝐹‘𝑄) +Q 𝑄) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)))
9		ltbtwnnqq 7445	. . 3 ⊢ (((𝐹‘𝑄) +Q 𝑄) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) ↔ ∃𝑥 ∈ Q (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))
10	8, 9	sylib 122	. 2 ⊢ (𝜑 → ∃𝑥 ∈ Q (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))
11		simprl 529	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝑥 ∈ Q)
12	1	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝑄 ∈ Q)
13		simprrl 539	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → ((𝐹‘𝑄) +Q 𝑄) <Q 𝑥)
14		fveq2 5534	. . . . . . . . 9 ⊢ (𝑞 = 𝑄 → (𝐹‘𝑞) = (𝐹‘𝑄))
15		id 19	. . . . . . . . 9 ⊢ (𝑞 = 𝑄 → 𝑞 = 𝑄)
16	14, 15	oveq12d 5915	. . . . . . . 8 ⊢ (𝑞 = 𝑄 → ((𝐹‘𝑞) +Q 𝑞) = ((𝐹‘𝑄) +Q 𝑄))
17	16	breq1d 4028	. . . . . . 7 ⊢ (𝑞 = 𝑄 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑥 ↔ ((𝐹‘𝑄) +Q 𝑄) <Q 𝑥))
18	17	rspcev 2856	. . . . . 6 ⊢ ((𝑄 ∈ Q ∧ ((𝐹‘𝑄) +Q 𝑄) <Q 𝑥) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑥)
19	12, 13, 18	syl2anc 411	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑥)
20		breq2 4022	. . . . . . 7 ⊢ (𝑢 = 𝑥 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ((𝐹‘𝑞) +Q 𝑞) <Q 𝑥))
21	20	rexbidv 2491	. . . . . 6 ⊢ (𝑢 = 𝑥 → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑥))
22		cauappcvgpr.lim	. . . . . . . 8 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩
23	22	fveq2i 5537	. . . . . . 7 ⊢ (2nd ‘𝐿) = (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩)
24		nqex 7393	. . . . . . . . 9 ⊢ Q ∈ V
25	24	rabex 4162	. . . . . . . 8 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ V
26	24	rabex 4162	. . . . . . . 8 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ V
27	25, 26	op2nd 6173	. . . . . . 7 ⊢ (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}
28	23, 27	eqtri 2210	. . . . . 6 ⊢ (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}
29	21, 28	elrab2 2911	. . . . 5 ⊢ (𝑥 ∈ (2nd ‘𝐿) ↔ (𝑥 ∈ Q ∧ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑥))
30	11, 19, 29	sylanbrc 417	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝑥 ∈ (2nd ‘𝐿))
31		simprrr 540	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)))
32		vex 2755	. . . . . . 7 ⊢ 𝑥 ∈ V
33		breq1 4021	. . . . . . 7 ⊢ (𝑙 = 𝑥 → (𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) ↔ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))
34	32, 33	elab 2896	. . . . . 6 ⊢ (𝑥 ∈ {𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))} ↔ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)))
35	31, 34	sylibr 134	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝑥 ∈ {𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))})
36		ltnqex 7579	. . . . . 6 ⊢ {𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))} ∈ V
37		gtnqex 7580	. . . . . 6 ⊢ {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢} ∈ V
38	36, 37	op1st 6172	. . . . 5 ⊢ (1st ‘⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩) = {𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}
39	35, 38	eleqtrrdi 2283	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩))
40		rspe 2539	. . . 4 ⊢ ((𝑥 ∈ Q ∧ (𝑥 ∈ (2nd ‘𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩))) → ∃𝑥 ∈ Q (𝑥 ∈ (2nd ‘𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩)))
41	11, 30, 39, 40	syl12anc 1247	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → ∃𝑥 ∈ Q (𝑥 ∈ (2nd ‘𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩)))
42		cauappcvgpr.app	. . . . . 6 ⊢ (𝜑 → ∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))))
43		cauappcvgpr.bnd	. . . . . 6 ⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
44	5, 42, 43, 22	cauappcvgprlemcl 7683	. . . . 5 ⊢ (𝜑 → 𝐿 ∈ P)
45	44	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝐿 ∈ P)
46		addclnq 7405	. . . . . . . 8 ⊢ ((𝑄 ∈ Q ∧ 𝑅 ∈ Q) → (𝑄 +Q 𝑅) ∈ Q)
47	1, 2, 46	syl2anc 411	. . . . . . 7 ⊢ (𝜑 → (𝑄 +Q 𝑅) ∈ Q)
48		addclnq 7405	. . . . . . 7 ⊢ (((𝐹‘𝑄) ∈ Q ∧ (𝑄 +Q 𝑅) ∈ Q) → ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) ∈ Q)
49	6, 47, 48	syl2anc 411	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) ∈ Q)
50		nqprlu 7577	. . . . . 6 ⊢ (((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩ ∈ P)
51	49, 50	syl 14	. . . . 5 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩ ∈ P)
52	51	adantr 276	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩ ∈ P)
53		ltdfpr 7536	. . . 4 ⊢ ((𝐿 ∈ P ∧ ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩ ∈ P) → (𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩ ↔ ∃𝑥 ∈ Q (𝑥 ∈ (2nd ‘𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩))))
54	45, 52, 53	syl2anc 411	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → (𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩ ↔ ∃𝑥 ∈ Q (𝑥 ∈ (2nd ‘𝐿) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩))))
55	41, 54	mpbird 167	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (((𝐹‘𝑄) +Q 𝑄) <Q 𝑥 ∧ 𝑥 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))))) → 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩)
56	10, 55	rexlimddv 2612	1 ⊢ (𝜑 → 𝐿<P ⟨{𝑙 ∣ 𝑙 <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅))}, {𝑢 ∣ ((𝐹‘𝑄) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2160  {cab 2175  ∀wral 2468  ∃wrex 2469  {crab 2472  ⟨cop 3610   class class class wbr 4018  ⟶wf 5231  ‘cfv 5235  (class class class)co 5897  1^st c1st 6164  2^nd c2nd 6165  Qcnq 7310   +_Q cplq 7312   <_Q cltq 7315  Pcnp 7321  <_P cltp 7325

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-iinf 4605

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-eprel 4307  df-id 4311  df-po 4314  df-iso 4315  df-iord 4384  df-on 4386  df-suc 4389  df-iom 4608  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-ov 5900  df-oprab 5901  df-mpo 5902  df-1st 6166  df-2nd 6167  df-recs 6331  df-irdg 6396  df-1o 6442  df-oadd 6446  df-omul 6447  df-er 6560  df-ec 6562  df-qs 6566  df-ni 7334  df-pli 7335  df-mi 7336  df-lti 7337  df-plpq 7374  df-mpq 7375  df-enq 7377  df-nqqs 7378  df-plqqs 7379  df-mqqs 7380  df-1nqqs 7381  df-rq 7382  df-ltnqqs 7383  df-inp 7496  df-iltp 7500

This theorem is referenced by:  cauappcvgprlemlim  7691