Theorem caucvgprlemcl 7990

Description: Lemma for caucvgpr 7996. 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 5669	. . . . . . 7 ⊢ (𝑗 = 𝑎 → (𝐹‘𝑗) = (𝐹‘𝑎))
5	4	breq2d 4120	. . . . . 6 ⊢ (𝑗 = 𝑎 → (𝐴 <Q (𝐹‘𝑗) ↔ 𝐴 <Q (𝐹‘𝑎)))
6	5	cbvralv 2777	. . . . 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 3882	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑎 → ⟨𝑗, 1o⟩ = ⟨𝑎, 1o⟩)
10	9	eceq1d 6802	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑎 → [⟨𝑗, 1o⟩] ~Q = [⟨𝑎, 1o⟩] ~Q )
11	10	fveq2d 5673	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑎 → (*Q‘[⟨𝑗, 1o⟩] ~Q ) = (*Q‘[⟨𝑎, 1o⟩] ~Q ))
12	11	oveq2d 6065	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
13	12, 4	breq12d 4121	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)))
14	13	cbvrexv 2778	. . . . . . . 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 2798	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} = {𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}
17	4, 11	oveq12d 6067	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
18	17	breq1d 4118	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → (((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢))
19	18	cbvrexv 2778	. . . . . . . 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 2798	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} = {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}
22	16, 21	opeq12i 3887	. . . . 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 2253	. . . 4 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}, {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}⟩
24	1, 2, 7, 23	caucvgprlemm 7982	. . 3 ⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))
25		ssrab2 3322	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ⊆ Q
26		nqex 7677	. . . . . . 7 ⊢ Q ∈ V
27	26	elpw2 4268	. . . . . 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 3322	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ⊆ Q
30	26	elpw2 4268	. . . . . 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 4780	. . . . 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 2305	. . 3 ⊢ 𝐿 ∈ (𝒫 Q × 𝒫 Q)
35	24, 34	jctil 312	. 2 ⊢ (𝜑 → (𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))))
36	1, 2, 7, 23	caucvgprlemrnd 7987	. . 3 ⊢ (𝜑 → (∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))))
37		breq1 4111	. . . . . . 7 ⊢ (𝑛 = 𝑐 → (𝑛 <N 𝑘 ↔ 𝑐 <N 𝑘))
38		fveq2 5669	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → (𝐹‘𝑛) = (𝐹‘𝑐))
39		opeq1 3882	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑐 → ⟨𝑛, 1o⟩ = ⟨𝑐, 1o⟩)
40	39	eceq1d 6802	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑐 → [⟨𝑛, 1o⟩] ~Q = [⟨𝑐, 1o⟩] ~Q )
41	40	fveq2d 5673	. . . . . . . . . 10 ⊢ (𝑛 = 𝑐 → (*Q‘[⟨𝑛, 1o⟩] ~Q ) = (*Q‘[⟨𝑐, 1o⟩] ~Q ))
42	41	oveq2d 6065	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
43	38, 42	breq12d 4121	. . . . . . . 8 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
44	38, 41	oveq12d 6067	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
45	44	breq2d 4120	. . . . . . . 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 4112	. . . . . . 7 ⊢ (𝑘 = 𝑑 → (𝑐 <N 𝑘 ↔ 𝑐 <N 𝑑))
49		fveq2 5669	. . . . . . . . . 10 ⊢ (𝑘 = 𝑑 → (𝐹‘𝑘) = (𝐹‘𝑑))
50	49	oveq1d 6064	. . . . . . . . 9 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) = ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
51	50	breq2d 4120	. . . . . . . 8 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
52	49	breq1d 4118	. . . . . . . 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 2790	. . . . 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 7988	. . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))
58	1, 2, 7, 23	caucvgprlemloc 7989	. . 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 7790	. 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 2203  ∀wral 2520  ∃wrex 2521  {crab 2524   ⊆ wss 3210  𝒫 cpw 3668  ⟨cop 3691   class class class wbr 4108   × cxp 4746  ⟶wf 5347  ‘cfv 5351  (class class class)co 6049  1^st c1st 6331  2^nd c2nd 6332  1_oc1o 6639  [cec 6764  Ncnpi 7586   <_N clti 7589   ~_Q ceq 7593  Qcnq 7594   +_Q cplq 7596  *_Qcrq 7598   <_Q cltq 7599  Pcnp 7605

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 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709

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 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-eprel 4409  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-1o 6646  df-oadd 6650  df-omul 6651  df-er 6766  df-ec 6768  df-qs 6772  df-ni 7618  df-pli 7619  df-mi 7620  df-lti 7621  df-plpq 7658  df-mpq 7659  df-enq 7661  df-nqqs 7662  df-plqqs 7663  df-mqqs 7664  df-1nqqs 7665  df-rq 7666  df-ltnqqs 7667  df-inp 7780

This theorem is referenced by:  caucvgprlemladdfu  7991  caucvgprlemladdrl  7992  caucvgprlem1  7993  caucvgprlem2  7994  caucvgpr  7996