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

Theorem caucvgprprlemmu 8069
Description: Lemma for caucvgprpr 8086. The upper cut of the putative limit is inhabited. (Contributed by Jim Kingdon, 29-Dec-2020.)
Hypotheses
Ref Expression
caucvgprpr.f (𝜑 → 𝐹:N⟶P)
caucvgprpr.cau (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
caucvgprpr.bnd (𝜑 → ∀𝑚 ∈ N 𝐴<P (𝐹‘𝑚))
caucvgprpr.lim 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}, {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩
Assertion
Ref Expression
caucvgprprlemmu (𝜑 → ∃𝑡 ∈ Q 𝑡 ∈ (2nd ‘𝐿))
Distinct variable groups:   𝐴,𝑚   𝑚,𝐹   𝐴,𝑟,𝑚   𝐹,𝑟,𝑢   𝑡,𝐿   𝑞,𝑝,𝑟,𝑢
Allowed substitution hints:   𝜑(𝑢, 𝑡, 𝑘, 𝑚, 𝑛, 𝑟, 𝑞, 𝑝, 𝑙)   𝐴(𝑢, 𝑡, 𝑘, 𝑛, 𝑞, 𝑝, 𝑙)   𝐹(𝑡, 𝑘, 𝑛, 𝑞, 𝑝, 𝑙)   𝐿(𝑢, 𝑘, 𝑚, 𝑛, 𝑟, 𝑞, 𝑝, 𝑙)

Proof of Theorem caucvgprprlemmu
Dummy variables 𝑓 𝑔 ℎ 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 caucvgprpr.f . . . 4 (𝜑 → 𝐹:N⟶P)
2 1pi 7689 . . . . 5 1o ∈ N
32a1i 9 . . . 4 (𝜑 → 1o ∈ N)
41, 3ffvelcdmd 5847 . . 3 (𝜑 → (𝐹‘1o) ∈ P)
5 prop 7849 . . 3 ((𝐹‘1o) ∈ P → ⟨(1st ‘(𝐹‘1o)), (2nd ‘(𝐹‘1o))⟩ ∈ P)
6 prmu 7852 . . 3 (⟨(1st ‘(𝐹‘1o)), (2nd ‘(𝐹‘1o))⟩ ∈ P → ∃𝑥 ∈ Q 𝑥 ∈ (2nd ‘(𝐹‘1o)))
74, 5, 63syl 17 . 2 (𝜑 → ∃𝑥 ∈ Q 𝑥 ∈ (2nd ‘(𝐹‘1o)))
8 simprl 535 . . . 4 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → 𝑥 ∈ Q)
9 1nq 7740 . . . 4 1Q ∈ Q
10 addclnq 7749 . . . 4 ((𝑥 ∈ Q ∧ 1Q ∈ Q) → (𝑥 +Q 1Q) ∈ Q)
118, 9, 10sylancl 417 . . 3 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → (𝑥 +Q 1Q) ∈ Q)
122a1i 9 . . . . 5 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → 1o ∈ N)
13 simprr 537 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → 𝑥 ∈ (2nd ‘(𝐹‘1o)))
144adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → (𝐹‘1o) ∈ P)
15 nqpru 7926 . . . . . . . . 9 ((𝑥 ∈ Q ∧ (𝐹‘1o) ∈ P) → (𝑥 ∈ (2nd ‘(𝐹‘1o)) ↔ (𝐹‘1o)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩))
168, 14, 15syl2anc 415 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → (𝑥 ∈ (2nd ‘(𝐹‘1o)) ↔ (𝐹‘1o)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩))
1713, 16mpbid 147 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → (𝐹‘1o)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩)
18 ltaprg 7993 . . . . . . . . 9 ((𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P) → (𝑓<P 𝑔 ↔ (ℎ +P 𝑓)<P (ℎ +P 𝑔)))
1918adantl 277 . . . . . . . 8 (((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P)) → (𝑓<P 𝑔 ↔ (ℎ +P 𝑓)<P (ℎ +P 𝑔)))
20 nqprlu 7921 . . . . . . . . 9 (𝑥 ∈ Q → ⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩ ∈ P)
218, 20syl 14 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩ ∈ P)
22 nqprlu 7921 . . . . . . . . 9 (1Q ∈ Q → ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩ ∈ P)
239, 22mp1i 10 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩ ∈ P)
24 addcomprg 7952 . . . . . . . . 9 ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
2524adantl 277 . . . . . . . 8 (((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
2619, 14, 21, 23, 25caovord2d 6262 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ((𝐹‘1o)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩ ↔ ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩)<P (⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩ +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩)))
2717, 26mpbid 147 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩)<P (⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩ +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩))
28 df-1nqqs 7725 . . . . . . . . . . . . 13 1Q = [⟨1o, 1o⟩] ~Q
2928fveq2i 5701 . . . . . . . . . . . 12 (*Q‘1Q) = (*Q‘[⟨1o, 1o⟩] ~Q )
30 rec1nq 7769 . . . . . . . . . . . 12 (*Q‘1Q) = 1Q
3129, 30eqtr3i 2261 . . . . . . . . . . 11 (*Q‘[⟨1o, 1o⟩] ~Q ) = 1Q
3231breq2i 4139 . . . . . . . . . 10 (𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q ) ↔ 𝑝 <Q 1Q)
3332abbii 2354 . . . . . . . . 9 {𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )} = {𝑝 ∣ 𝑝 <Q 1Q}
3431breq1i 4138 . . . . . . . . . 10 ((*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞 ↔ 1Q <Q 𝑞)
3534abbii 2354 . . . . . . . . 9 {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞} = {𝑞 ∣ 1Q <Q 𝑞}
3633, 35opeq12i 3909 . . . . . . . 8 ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩
3736oveq2i 6099 . . . . . . 7 ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩) = ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩)
3837a1i 9 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩) = ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩))
39 addnqpr 7935 . . . . . . 7 ((𝑥 ∈ Q ∧ 1Q ∈ Q) → ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩ = (⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩ +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩))
408, 9, 39sylancl 417 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩ = (⟨{𝑝 ∣ 𝑝 <Q 𝑥}, {𝑞 ∣ 𝑥 <Q 𝑞}⟩ +P ⟨{𝑝 ∣ 𝑝 <Q 1Q}, {𝑞 ∣ 1Q <Q 𝑞}⟩))
4127, 38, 403brtr4d 4163 . . . . 5 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩)
42 fveq2 5698 . . . . . . . 8 (𝑟 = 1o → (𝐹‘𝑟) = (𝐹‘1o))
43 opeq1 3904 . . . . . . . . . . . . 13 (𝑟 = 1o → ⟨𝑟, 1o⟩ = ⟨1o, 1o⟩)
4443eceq1d 6847 . . . . . . . . . . . 12 (𝑟 = 1o → [⟨𝑟, 1o⟩] ~Q = [⟨1o, 1o⟩] ~Q )
4544fveq2d 5702 . . . . . . . . . . 11 (𝑟 = 1o → (*Q‘[⟨𝑟, 1o⟩] ~Q ) = (*Q‘[⟨1o, 1o⟩] ~Q ))
4645breq2d 4143 . . . . . . . . . 10 (𝑟 = 1o → (𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q ) ↔ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )))
4746abbidv 2358 . . . . . . . . 9 (𝑟 = 1o → {𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )} = {𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )})
4845breq1d 4141 . . . . . . . . . 10 (𝑟 = 1o → ((*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞 ↔ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞))
4948abbidv 2358 . . . . . . . . 9 (𝑟 = 1o → {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞} = {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞})
5047, 49opeq12d 3912 . . . . . . . 8 (𝑟 = 1o → ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩)
5142, 50oveq12d 6106 . . . . . . 7 (𝑟 = 1o → ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩) = ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩))
5251breq1d 4141 . . . . . 6 (𝑟 = 1o → (((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩ ↔ ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩))
5352rspcev 2929 . . . . 5 ((1o ∈ N ∧ ((𝐹‘1o) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨1o, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨1o, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩) → ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩)
5412, 41, 53syl2anc 415 . . . 4 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩)
55 breq2 4135 . . . . . . . . 9 (𝑢 = (𝑥 +Q 1Q) → (𝑝 <Q 𝑢 ↔ 𝑝 <Q (𝑥 +Q 1Q)))
5655abbidv 2358 . . . . . . . 8 (𝑢 = (𝑥 +Q 1Q) → {𝑝 ∣ 𝑝 <Q 𝑢} = {𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)})
57 breq1 4134 . . . . . . . . 9 (𝑢 = (𝑥 +Q 1Q) → (𝑢 <Q 𝑞 ↔ (𝑥 +Q 1Q) <Q 𝑞))
5857abbidv 2358 . . . . . . . 8 (𝑢 = (𝑥 +Q 1Q) → {𝑞 ∣ 𝑢 <Q 𝑞} = {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞})
5956, 58opeq12d 3912 . . . . . . 7 (𝑢 = (𝑥 +Q 1Q) → ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩)
6059breq2d 4143 . . . . . 6 (𝑢 = (𝑥 +Q 1Q) → (((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩ ↔ ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩))
6160rexbidv 2551 . . . . 5 (𝑢 = (𝑥 +Q 1Q) → (∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩ ↔ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩))
62 caucvgprpr.lim . . . . . . 7 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}, {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩
6362fveq2i 5701 . . . . . 6 (2nd ‘𝐿) = (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}, {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩)
64 nqex 7737 . . . . . . . 8 Q ∈ V
6564rabex 4282 . . . . . . 7 {𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)} ∈ V
6664rabex 4282 . . . . . . 7 {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩} ∈ V
6765, 66op2nd 6385 . . . . . 6 (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}, {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}⟩) = {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}
6863, 67eqtri 2259 . . . . 5 (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩}
6961, 68elrab2 2985 . . . 4 ((𝑥 +Q 1Q) ∈ (2nd ‘𝐿) ↔ ((𝑥 +Q 1Q) ∈ Q ∧ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q (𝑥 +Q 1Q)}, {𝑞 ∣ (𝑥 +Q 1Q) <Q 𝑞}⟩))
7011, 54, 69sylanbrc 421 . . 3 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → (𝑥 +Q 1Q) ∈ (2nd ‘𝐿))
71 eleq1 2301 . . . 4 (𝑡 = (𝑥 +Q 1Q) → (𝑡 ∈ (2nd ‘𝐿) ↔ (𝑥 +Q 1Q) ∈ (2nd ‘𝐿)))
7271rspcev 2929 . . 3 (((𝑥 +Q 1Q) ∈ Q ∧ (𝑥 +Q 1Q) ∈ (2nd ‘𝐿)) → ∃𝑡 ∈ Q 𝑡 ∈ (2nd ‘𝐿))
7311, 70, 72syl2anc 415 . 2 ((𝜑 ∧ (𝑥 ∈ Q ∧ 𝑥 ∈ (2nd ‘(𝐹‘1o)))) → ∃𝑡 ∈ Q 𝑡 ∈ (2nd ‘𝐿))
747, 73rexlimddv 2673 1 (𝜑 → ∃𝑡 ∈ Q 𝑡 ∈ (2nd ‘𝐿))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  {crab 2532  ⟨cop 3712   class class class wbr 4131  ⟶wf 5376  ‘cfv 5380  (class class class)co 6088  1st c1st 6376  2nd c2nd 6377  1oc1o 6684  [cec 6809  Ncnpi 7646   <N clti 7649   ~Q ceq 7653  Qcnq 7654  1Qc1q 7655   +Q cplq 7656  *Qcrq 7658   <Q cltq 7659  Pcnp 7665   +P cpp 7667  <P cltp 7669
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-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
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-ral 2533  df-rex 2534  df-reu 2535  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-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-2o 6692  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7678  df-pli 7679  df-mi 7680  df-lti 7681  df-plpq 7718  df-mpq 7719  df-enq 7721  df-nqqs 7722  df-plqqs 7723  df-mqqs 7724  df-1nqqs 7725  df-rq 7726  df-ltnqqs 7727  df-enq0 7798  df-nq0 7799  df-0nq0 7800  df-plq0 7801  df-mq0 7802  df-inp 7840  df-iplp 7842  df-iltp 7844
This theorem is used by:  caucvgprprlemm  8070
  Copyright terms: Public domain W3C validator