Theorem caucvgprlemcl 7477

Description: Lemma for caucvgpr 7483. 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 5414	. . . . . . 7 ⊢ (𝑗 = 𝑎 → (𝐹‘𝑗) = (𝐹‘𝑎))
5	4	breq2d 3936	. . . . . 6 ⊢ (𝑗 = 𝑎 → (𝐴 <Q (𝐹‘𝑗) ↔ 𝐴 <Q (𝐹‘𝑎)))
6	5	cbvralv 2652	. . . . 5 ⊢ (∀𝑗 ∈ N 𝐴 <Q (𝐹‘𝑗) ↔ ∀𝑎 ∈ N 𝐴 <Q (𝐹‘𝑎))
7	3, 6	sylib 121	. . . 4 ⊢ (𝜑 → ∀𝑎 ∈ N 𝐴 <Q (𝐹‘𝑎))
8		caucvgpr.lim	. . . . 5 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩
9		opeq1 3700	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑎 → ⟨𝑗, 1o⟩ = ⟨𝑎, 1o⟩)
10	9	eceq1d 6458	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑎 → [⟨𝑗, 1o⟩] ~Q = [⟨𝑎, 1o⟩] ~Q )
11	10	fveq2d 5418	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑎 → (*Q‘[⟨𝑗, 1o⟩] ~Q ) = (*Q‘[⟨𝑎, 1o⟩] ~Q ))
12	11	oveq2d 5783	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
13	12, 4	breq12d 3937	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)))
14	13	cbvrexv 2653	. . . . . . . 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 2666	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} = {𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}
17	4, 11	oveq12d 5785	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
18	17	breq1d 3934	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → (((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢))
19	18	cbvrexv 2653	. . . . . . . 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 2666	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} = {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}
22	16, 21	opeq12i 3705	. . . . 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 2158	. . . 4 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}, {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}⟩
24	1, 2, 7, 23	caucvgprlemm 7469	. . 3 ⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))
25		ssrab2 3177	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ⊆ Q
26		nqex 7164	. . . . . . 7 ⊢ Q ∈ V
27	26	elpw2 4077	. . . . . 6 ⊢ ({𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ 𝒫 Q ↔ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ⊆ Q)
28	25, 27	mpbir 145	. . . . 5 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ∈ 𝒫 Q
29		ssrab2 3177	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ⊆ Q
30	26	elpw2 4077	. . . . . 6 ⊢ ({𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ 𝒫 Q ↔ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ⊆ Q)
31	29, 30	mpbir 145	. . . . 5 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ∈ 𝒫 Q
32		opelxpi 4566	. . . . 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 422	. . . 4 ⊢ ⟨{𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)}, {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢}⟩ ∈ (𝒫 Q × 𝒫 Q)
34	8, 33	eqeltri 2210	. . 3 ⊢ 𝐿 ∈ (𝒫 Q × 𝒫 Q)
35	24, 34	jctil 310	. 2 ⊢ (𝜑 → (𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))))
36	1, 2, 7, 23	caucvgprlemrnd 7474	. . 3 ⊢ (𝜑 → (∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))))
37		breq1 3927	. . . . . . 7 ⊢ (𝑛 = 𝑐 → (𝑛 <N 𝑘 ↔ 𝑐 <N 𝑘))
38		fveq2 5414	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → (𝐹‘𝑛) = (𝐹‘𝑐))
39		opeq1 3700	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑐 → ⟨𝑛, 1o⟩ = ⟨𝑐, 1o⟩)
40	39	eceq1d 6458	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑐 → [⟨𝑛, 1o⟩] ~Q = [⟨𝑐, 1o⟩] ~Q )
41	40	fveq2d 5418	. . . . . . . . . 10 ⊢ (𝑛 = 𝑐 → (*Q‘[⟨𝑛, 1o⟩] ~Q ) = (*Q‘[⟨𝑐, 1o⟩] ~Q ))
42	41	oveq2d 5783	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
43	38, 42	breq12d 3937	. . . . . . . 8 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
44	38, 41	oveq12d 5785	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
45	44	breq2d 3936	. . . . . . . 8 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑘) <Q ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ↔ (𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
46	43, 45	anbi12d 464	. . . . . . 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 233	. . . . . 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 3928	. . . . . . 7 ⊢ (𝑘 = 𝑑 → (𝑐 <N 𝑘 ↔ 𝑐 <N 𝑑))
49		fveq2 5414	. . . . . . . . . 10 ⊢ (𝑘 = 𝑑 → (𝐹‘𝑘) = (𝐹‘𝑑))
50	49	oveq1d 5782	. . . . . . . . 9 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) = ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
51	50	breq2d 3936	. . . . . . . 8 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
52	49	breq1d 3934	. . . . . . . 8 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑘) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ↔ (𝐹‘𝑑) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
53	51, 52	anbi12d 464	. . . . . . 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 233	. . . . . 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 2660	. . . . 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 121	. . . 4 ⊢ (𝜑 → ∀𝑐 ∈ N ∀𝑑 ∈ N (𝑐 <N 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ∧ (𝐹‘𝑑) <Q ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))))
57	1, 56, 7, 23	caucvgprlemdisj 7475	. . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))
58	1, 2, 7, 23	caucvgprlemloc 7476	. . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿))))
59	36, 57, 58	3jca 1161	. 2 ⊢ (𝜑 → ((∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))) ∧ ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)) ∧ ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿)))))
60		elnp1st2nd 7277	. 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 413	1 ⊢ (𝜑 → 𝐿 ∈ P)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 697   ∧ w3a 962   = wceq 1331   ∈ wcel 1480  ∀wral 2414  ∃wrex 2415  {crab 2418   ⊆ wss 3066  𝒫 cpw 3505  ⟨cop 3525   class class class wbr 3924   × cxp 4532  ⟶wf 5114  ‘cfv 5118  (class class class)co 5767  1^st c1st 6029  2^nd c2nd 6030  1_oc1o 6299  [cec 6420  Ncnpi 7073   <_N clti 7076   ~_Q ceq 7080  Qcnq 7081   +_Q cplq 7083  *_Qcrq 7085   <_Q cltq 7086  Pcnp 7092

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-1o 6306  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-pli 7106  df-mi 7107  df-lti 7108  df-plpq 7145  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-plqqs 7150  df-mqqs 7151  df-1nqqs 7152  df-rq 7153  df-ltnqqs 7154  df-inp 7267

This theorem is referenced by:  caucvgprlemladdfu  7478  caucvgprlemladdrl  7479  caucvgprlem1  7480  caucvgprlem2  7481  caucvgpr  7483