Theorem caucvgprlemcl 7939

Description: Lemma for caucvgpr 7945. The putative limit is a positive real. (Contributed by Jim Kingdon, 26-Sep-2020.)

Hypotheses

Ref	Expression
caucvgpr.f	⊢ (𝜑 → 𝐹:N⟶Q)
caucvgpr.cau	⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
caucvgpr.bnd	⊢ (𝜑 → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
caucvgpr.lim	⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩

Assertion

Ref	Expression
caucvgprlemcl	⊢ (𝜑 → 𝐿 ∈ P)

Distinct variable groups:   𝐴,𝑗   𝑗,𝐹,𝑙   𝑢,𝐹,𝑗   𝑛,𝐹,𝑘   𝑗,𝑘,𝐿   𝑘,𝑛

Allowed substitution hints:   𝜑(𝑢,𝑗,𝑘,𝑛,𝑙)   𝐴(𝑢,𝑘,𝑛,𝑙)   𝐿(𝑢,𝑛,𝑙)

Proof of Theorem caucvgprlemcl

Dummy variables 𝑠 𝑎 𝑐 𝑑 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		caucvgpr.f	. . . 4 ⊢ (𝜑 → 𝐹:N⟶Q)
2		caucvgpr.cau	. . . 4 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))))
3		caucvgpr.bnd	. . . . 5 ⊢ (𝜑 → ∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗))
4		fveq2 5648	. . . . . . 7 ⊢ (𝑗 = 𝑎 → (𝐹‘𝑗) = (𝐹‘𝑎))
5	4	breq2d 4105	. . . . . 6 ⊢ (𝑗 = 𝑎 → (𝐴 <Q (𝐹‘𝑗) ↔ 𝐴 <Q (𝐹‘𝑎)))
6	5	cbvralv 2768	. . . . 5 ⊢ (∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗) ↔ ∀𝑎 ∈ N 𝐴 <Q (𝐹‘𝑎))
7	3, 6	sylib 122	. . . 4 ⊢ (𝜑 → ∀𝑎 ∈ N 𝐴 <Q (𝐹‘𝑎))
8		caucvgpr.lim	. . . . 5 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
9		opeq1 3867	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑎 → ⟨𝑗, 1o⟩ = ⟨𝑎, 1o⟩)
10	9	eceq1d 6781	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑎 → [⟨𝑗, 1o⟩] ~Q = [⟨𝑎, 1o⟩] ~Q )
11	10	fveq2d 5652	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑎 → (*Q‘[⟨𝑗, 1o⟩] ~Q ) = (*Q‘[⟨𝑎, 1o⟩] ~Q ))
12	11	oveq2d 6044	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
13	12, 4	breq12d 4106	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)))
14	13	cbvrexv 2769	. . . . . . . 8 ⊢ (∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎))
15	14	a1i 9	. . . . . . 7 ⊢ (𝑙 ∈ Q → (∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)))
16	15	rabbiia 2789	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} = {𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}
17	4, 11	oveq12d 6046	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
18	17	breq1d 4103	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → (((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢))
19	18	cbvrexv 2769	. . . . . . . 8 ⊢ (∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢)
20	19	a1i 9	. . . . . . 7 ⊢ (𝑢 ∈ Q → (∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢))
21	20	rabbiia 2789	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} = {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}
22	16, 21	opeq12i 3872	. . . . 5 ⊢ ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩ = ⟨{𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}, {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}⟩
23	8, 22	eqtri 2252	. . . 4 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}, {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}⟩
24	1, 2, 7, 23	caucvgprlemm 7931	. . 3 ⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))
25		ssrab2 3313	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ⊆ Q
26		nqex 7626	. . . . . . 7 ⊢ Q ∈ V
27	26	elpw2 4252	. . . . . 6 ⊢ ({𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ 𝒫 Q ↔ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ⊆ Q)
28	25, 27	mpbir 146	. . . . 5 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ 𝒫 Q
29		ssrab2 3313	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ⊆ Q
30	26	elpw2 4252	. . . . . 6 ⊢ ({𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ 𝒫 Q ↔ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ⊆ Q)
31	29, 30	mpbir 146	. . . . 5 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ 𝒫 Q
32		opelxpi 4763	. . . . 5 ⊢ (({𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ 𝒫 Q ∧ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ 𝒫 Q) → ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩ ∈ (𝒫 Q × 𝒫 Q))
33	28, 31, 32	mp2an 426	. . . 4 ⊢ ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩ ∈ (𝒫 Q × 𝒫 Q)
34	8, 33	eqeltri 2304	. . 3 ⊢ 𝐿 ∈ (𝒫 Q × 𝒫 Q)
35	24, 34	jctil 312	. 2 ⊢ (𝜑 → (𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))))
36	1, 2, 7, 23	caucvgprlemrnd 7936	. . 3 ⊢ (𝜑 → (∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))))
37		breq1 4096	. . . . . . 7 ⊢ (𝑛 = 𝑐 → (𝑛 <N 𝑘 ↔ 𝑐 <N 𝑘))
38		fveq2 5648	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → (𝐹‘𝑛) = (𝐹‘𝑐))
39		opeq1 3867	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑐 → ⟨𝑛, 1o⟩ = ⟨𝑐, 1o⟩)
40	39	eceq1d 6781	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑐 → [⟨𝑛, 1o⟩] ~Q = [⟨𝑐, 1o⟩] ~Q )
41	40	fveq2d 5652	. . . . . . . . . 10 ⊢ (𝑛 = 𝑐 → (*Q‘[⟨𝑛, 1o⟩] ~Q ) = (*Q‘[⟨𝑐, 1o⟩] ~Q ))
42	41	oveq2d 6044	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
43	38, 42	breq12d 4106	. . . . . . . 8 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
44	38, 41	oveq12d 6046	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
45	44	breq2d 4105	. . . . . . . 8 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ↔ (𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
46	43, 45	anbi12d 473	. . . . . . 7 ⊢ (𝑛 = 𝑐 → (((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q ))) ↔ ((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))))
47	37, 46	imbi12d 234	. . . . . 6 ⊢ (𝑛 = 𝑐 → ((𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))) ↔ (𝑐 <N 𝑘 → ((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))))
48		breq2 4097	. . . . . . 7 ⊢ (𝑘 = 𝑑 → (𝑐 <N 𝑘 ↔ 𝑐 <N 𝑑))
49		fveq2 5648	. . . . . . . . . 10 ⊢ (𝑘 = 𝑑 → (𝐹‘𝑘) = (𝐹‘𝑑))
50	49	oveq1d 6043	. . . . . . . . 9 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) = ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
51	50	breq2d 4105	. . . . . . . 8 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
52	49	breq1d 4103	. . . . . . . 8 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ↔ (𝐹‘𝑑) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
53	51, 52	anbi12d 473	. . . . . . 7 ⊢ (𝑘 = 𝑑 → (((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))) ↔ ((𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑑) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))))
54	48, 53	imbi12d 234	. . . . . 6 ⊢ (𝑘 = 𝑑 → ((𝑐 <N 𝑘 → ((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))) ↔ (𝑐 <N 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑑) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))))
55	47, 54	cbvral2v 2781	. . . . 5 ⊢ (∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ∧ (𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )))) ↔ ∀𝑐 ∈ N ∀𝑑 ∈ N (𝑐 <N 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑑) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))))
56	2, 55	sylib 122	. . . 4 ⊢ (𝜑 → ∀𝑐 ∈ N ∀𝑑 ∈ N (𝑐 <N 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑑) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))))
57	1, 56, 7, 23	caucvgprlemdisj 7937	. . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))
58	1, 2, 7, 23	caucvgprlemloc 7938	. . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿))))
59	36, 57, 58	3jca 1204	. 2 ⊢ (𝜑 → ((∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))) ∧ ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)) ∧ ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿)))))
60		elnp1st2nd 7739	. 2 ⊢ (𝐿 ∈ P ↔ ((𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))) ∧ ((∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))) ∧ ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)) ∧ ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿))))))
61	35, 59, 60	sylanbrc 417	1 ⊢ (𝜑 → 𝐿 ∈ P)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716   ∧ w3a 1005   = wceq 1398   ∈ wcel 2202  ∀wral 2511  ∃wrex 2512  {crab 2515   ⊆ wss 3201  𝒫 cpw 3656  ⟨cop 3676   class class class wbr 4093   × cxp 4729  ⟶wf 5329  ‘cfv 5333  (class class class)co 6028  1^st c1st 6310  2^nd c2nd 6311  1_oc1o 6618  [cec 6743  Ncnpi 7535   <_N clti 7538   ~_Q ceq 7542  Qcnq 7543   +_Q cplq 7545  *_Qcrq 7547   <_Q cltq 7548  Pcnp 7554

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616  df-inp 7729

This theorem is referenced by:  caucvgprlemladdfu  7940  caucvgprlemladdrl  7941  caucvgprlem1  7942  caucvgprlem2  7943  caucvgpr  7945