Theorem cauappcvgprlemm 7477

Description: Lemma for cauappcvgpr 7494. The putative limit is inhabited. (Contributed by Jim Kingdon, 18-Jul-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 𝑢}⟩

Assertion

Ref	Expression
cauappcvgprlemm	⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))

Distinct variable groups:   𝐴,𝑝   𝐿,𝑝,𝑞   𝜑,𝑝,𝑞   𝐿,𝑟,𝑠   𝐴,𝑠,𝑝   𝐹,𝑙,𝑢,𝑝,𝑞,𝑟,𝑠   𝜑,𝑟,𝑠

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

Proof of Theorem cauappcvgprlemm

Step	Hyp	Ref	Expression
1		fveq2 5429	. . . . . . 7 ⊢ (𝑝 = 1Q → (𝐹‘𝑝) = (𝐹‘1Q))
2	1	breq2d 3949	. . . . . 6 ⊢ (𝑝 = 1Q → (𝐴 <Q (𝐹‘𝑝) ↔ 𝐴 <Q (𝐹‘1Q)))
3		cauappcvgpr.bnd	. . . . . 6 ⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
4		1nq 7198	. . . . . . 7 ⊢ 1Q ∈ Q
5	4	a1i 9	. . . . . 6 ⊢ (𝜑 → 1Q ∈ Q)
6	2, 3, 5	rspcdva 2798	. . . . 5 ⊢ (𝜑 → 𝐴 <Q (𝐹‘1Q))
7		ltrelnq 7197	. . . . . . 7 ⊢ <Q ⊆ (Q × Q)
8	7	brel 4599	. . . . . 6 ⊢ (𝐴 <Q (𝐹‘1Q) → (𝐴 ∈ Q ∧ (𝐹‘1Q) ∈ Q))
9	8	simpld 111	. . . . 5 ⊢ (𝐴 <Q (𝐹‘1Q) → 𝐴 ∈ Q)
10	6, 9	syl 14	. . . 4 ⊢ (𝜑 → 𝐴 ∈ Q)
11		halfnqq 7242	. . . 4 ⊢ (𝐴 ∈ Q → ∃𝑠 ∈ Q (𝑠 +Q 𝑠) = 𝐴)
12	10, 11	syl 14	. . 3 ⊢ (𝜑 → ∃𝑠 ∈ Q (𝑠 +Q 𝑠) = 𝐴)
13		simplr 520	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → 𝑠 ∈ Q)
14	3	ad2antrr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
15		fveq2 5429	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑠 → (𝐹‘𝑝) = (𝐹‘𝑠))
16	15	breq2d 3949	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑠 → (𝐴 <Q (𝐹‘𝑝) ↔ 𝐴 <Q (𝐹‘𝑠)))
17	16	rspcv 2789	. . . . . . . . . 10 ⊢ (𝑠 ∈ Q → (∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝) → 𝐴 <Q (𝐹‘𝑠)))
18	17	ad2antlr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → (∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝) → 𝐴 <Q (𝐹‘𝑠)))
19	14, 18	mpd 13	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → 𝐴 <Q (𝐹‘𝑠))
20		breq1 3940	. . . . . . . . 9 ⊢ ((𝑠 +Q 𝑠) = 𝐴 → ((𝑠 +Q 𝑠) <Q (𝐹‘𝑠) ↔ 𝐴 <Q (𝐹‘𝑠)))
21	20	adantl 275	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → ((𝑠 +Q 𝑠) <Q (𝐹‘𝑠) ↔ 𝐴 <Q (𝐹‘𝑠)))
22	19, 21	mpbird 166	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → (𝑠 +Q 𝑠) <Q (𝐹‘𝑠))
23		oveq2 5790	. . . . . . . . 9 ⊢ (𝑞 = 𝑠 → (𝑠 +Q 𝑞) = (𝑠 +Q 𝑠))
24		fveq2 5429	. . . . . . . . 9 ⊢ (𝑞 = 𝑠 → (𝐹‘𝑞) = (𝐹‘𝑠))
25	23, 24	breq12d 3950	. . . . . . . 8 ⊢ (𝑞 = 𝑠 → ((𝑠 +Q 𝑞) <Q (𝐹‘𝑞) ↔ (𝑠 +Q 𝑠) <Q (𝐹‘𝑠)))
26	25	rspcev 2793	. . . . . . 7 ⊢ ((𝑠 ∈ Q ∧ (𝑠 +Q 𝑠) <Q (𝐹‘𝑠)) → ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞))
27	13, 22, 26	syl2anc 409	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞))
28		oveq1 5789	. . . . . . . . 9 ⊢ (𝑙 = 𝑠 → (𝑙 +Q 𝑞) = (𝑠 +Q 𝑞))
29	28	breq1d 3947	. . . . . . . 8 ⊢ (𝑙 = 𝑠 → ((𝑙 +Q 𝑞) <Q (𝐹‘𝑞) ↔ (𝑠 +Q 𝑞) <Q (𝐹‘𝑞)))
30	29	rexbidv 2439	. . . . . . 7 ⊢ (𝑙 = 𝑠 → (∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞) ↔ ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞)))
31		cauappcvgpr.lim	. . . . . . . . 9 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩
32	31	fveq2i 5432	. . . . . . . 8 ⊢ (1st ‘𝐿) = (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩)
33		nqex 7195	. . . . . . . . . 10 ⊢ Q ∈ V
34	33	rabex 4080	. . . . . . . . 9 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ V
35	33	rabex 4080	. . . . . . . . 9 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ V
36	34, 35	op1st 6052	. . . . . . . 8 ⊢ (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩) = {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}
37	32, 36	eqtri 2161	. . . . . . 7 ⊢ (1st ‘𝐿) = {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}
38	30, 37	elrab2 2847	. . . . . 6 ⊢ (𝑠 ∈ (1st ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞)))
39	13, 27, 38	sylanbrc 414	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → 𝑠 ∈ (1st ‘𝐿))
40	39	ex 114	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ Q) → ((𝑠 +Q 𝑠) = 𝐴 → 𝑠 ∈ (1st ‘𝐿)))
41	40	reximdva 2537	. . 3 ⊢ (𝜑 → (∃𝑠 ∈ Q (𝑠 +Q 𝑠) = 𝐴 → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿)))
42	12, 41	mpd 13	. 2 ⊢ (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿))
43		cauappcvgpr.f	. . . . . 6 ⊢ (𝜑 → 𝐹:Q⟶Q)
44	43, 5	ffvelrnd 5564	. . . . 5 ⊢ (𝜑 → (𝐹‘1Q) ∈ Q)
45		addclnq 7207	. . . . 5 ⊢ (((𝐹‘1Q) ∈ Q ∧ 1Q ∈ Q) → ((𝐹‘1Q) +Q 1Q) ∈ Q)
46	44, 5, 45	syl2anc 409	. . . 4 ⊢ (𝜑 → ((𝐹‘1Q) +Q 1Q) ∈ Q)
47		addclnq 7207	. . . 4 ⊢ ((((𝐹‘1Q) +Q 1Q) ∈ Q ∧ 1Q ∈ Q) → (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q)
48	46, 5, 47	syl2anc 409	. . 3 ⊢ (𝜑 → (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q)
49		ltaddnq 7239	. . . . . 6 ⊢ ((((𝐹‘1Q) +Q 1Q) ∈ Q ∧ 1Q ∈ Q) → ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
50	46, 5, 49	syl2anc 409	. . . . 5 ⊢ (𝜑 → ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
51		fveq2 5429	. . . . . . . 8 ⊢ (𝑞 = 1Q → (𝐹‘𝑞) = (𝐹‘1Q))
52		id 19	. . . . . . . 8 ⊢ (𝑞 = 1Q → 𝑞 = 1Q)
53	51, 52	oveq12d 5800	. . . . . . 7 ⊢ (𝑞 = 1Q → ((𝐹‘𝑞) +Q 𝑞) = ((𝐹‘1Q) +Q 1Q))
54	53	breq1d 3947	. . . . . 6 ⊢ (𝑞 = 1Q → (((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q) ↔ ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
55	54	rspcev 2793	. . . . 5 ⊢ ((1Q ∈ Q ∧ ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
56	5, 50, 55	syl2anc 409	. . . 4 ⊢ (𝜑 → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
57		breq2 3941	. . . . . 6 ⊢ (𝑢 = (((𝐹‘1Q) +Q 1Q) +Q 1Q) → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
58	57	rexbidv 2439	. . . . 5 ⊢ (𝑢 = (((𝐹‘1Q) +Q 1Q) +Q 1Q) → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
59	31	fveq2i 5432	. . . . . 6 ⊢ (2nd ‘𝐿) = (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩)
60	34, 35	op2nd 6053	. . . . . 6 ⊢ (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}
61	59, 60	eqtri 2161	. . . . 5 ⊢ (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}
62	58, 61	elrab2 2847	. . . 4 ⊢ ((((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿) ↔ ((((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q ∧ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
63	48, 56, 62	sylanbrc 414	. . 3 ⊢ (𝜑 → (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿))
64		eleq1 2203	. . . 4 ⊢ (𝑟 = (((𝐹‘1Q) +Q 1Q) +Q 1Q) → (𝑟 ∈ (2nd ‘𝐿) ↔ (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿)))
65	64	rspcev 2793	. . 3 ⊢ (((((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q ∧ (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿)) → ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))
66	48, 63, 65	syl2anc 409	. 2 ⊢ (𝜑 → ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))
67	42, 66	jca 304	1 ⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1332   ∈ wcel 1481  ∀wral 2417  ∃wrex 2418  {crab 2421  ⟨cop 3535   class class class wbr 3937  ⟶wf 5127  ‘cfv 5131  (class class class)co 5782  1^st c1st 6044  2^nd c2nd 6045  Qcnq 7112  1_Qc1q 7113   +_Q cplq 7114   <_Q cltq 7117

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-eprel 4219  df-id 4223  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-irdg 6275  df-1o 6321  df-oadd 6325  df-omul 6326  df-er 6437  df-ec 6439  df-qs 6443  df-ni 7136  df-pli 7137  df-mi 7138  df-lti 7139  df-plpq 7176  df-mpq 7177  df-enq 7179  df-nqqs 7180  df-plqqs 7181  df-mqqs 7182  df-1nqqs 7183  df-rq 7184  df-ltnqqs 7185

This theorem is referenced by:  cauappcvgprlemcl  7485