Theorem caucvgprlemcl 7484

Description: Lemma for caucvgpr 7490. 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 5421	. . . . . . 7 ⊢ (𝑗 = 𝑎 → (𝐹‘𝑗) = (𝐹‘𝑎))
5	4	breq2d 3941	. . . . . 6 ⊢ (𝑗 = 𝑎 → (𝐴 <Q (𝐹‘𝑗) ↔ 𝐴 <Q (𝐹‘𝑎)))
6	5	cbvralv 2654	. . . . 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 3705	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑎 → ⟨𝑗, 1o⟩ = ⟨𝑎, 1o⟩)
10	9	eceq1d 6465	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑎 → [⟨𝑗, 1o⟩] ~Q = [⟨𝑎, 1o⟩] ~Q )
11	10	fveq2d 5425	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑎 → (*Q‘[⟨𝑗, 1o⟩] ~Q ) = (*Q‘[⟨𝑎, 1o⟩] ~Q ))
12	11	oveq2d 5790	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
13	12, 4	breq12d 3942	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → ((𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗) ↔ (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)))
14	13	cbvrexv 2655	. . . . . . . 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 2671	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} = {𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}
17	4, 11	oveq12d 5792	. . . . . . . . . 10 ⊢ (𝑗 = 𝑎 → ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) = ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
18	17	breq1d 3939	. . . . . . . . 9 ⊢ (𝑗 = 𝑎 → (((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢 ↔ ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢))
19	18	cbvrexv 2655	. . . . . . . 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 2671	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} = {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}
22	16, 21	opeq12i 3710	. . . . 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 2160	. . . 4 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑎 ∈ N (𝑙 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q (𝐹‘𝑎)}, {𝑢 ∈ Q ∣ ∃𝑎 ∈ N ((𝐹‘𝑎) +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑢}⟩
24	1, 2, 7, 23	caucvgprlemm 7476	. . 3 ⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))
25		ssrab2 3182	. . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑗 ∈ N (𝑙 +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q (𝐹‘𝑗)} ⊆ Q
26		nqex 7171	. . . . . . 7 ⊢ Q ∈ V
27	26	elpw2 4082	. . . . . 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 3182	. . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑗 ∈ N ((𝐹‘𝑗) +Q (*Q‘[⟨𝑗, 1o⟩] ~Q )) <Q 𝑢} ⊆ Q
30	26	elpw2 4082	. . . . . 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 4571	. . . . 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 2212	. . 3 ⊢ 𝐿 ∈ (𝒫 Q × 𝒫 Q)
35	24, 34	jctil 310	. 2 ⊢ (𝜑 → (𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))))
36	1, 2, 7, 23	caucvgprlemrnd 7481	. . 3 ⊢ (𝜑 → (∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))))
37		breq1 3932	. . . . . . 7 ⊢ (𝑛 = 𝑐 → (𝑛 <N 𝑘 ↔ 𝑐 <N 𝑘))
38		fveq2 5421	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → (𝐹‘𝑛) = (𝐹‘𝑐))
39		opeq1 3705	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑐 → ⟨𝑛, 1o⟩ = ⟨𝑐, 1o⟩)
40	39	eceq1d 6465	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑐 → [⟨𝑛, 1o⟩] ~Q = [⟨𝑐, 1o⟩] ~Q )
41	40	fveq2d 5425	. . . . . . . . . 10 ⊢ (𝑛 = 𝑐 → (*Q‘[⟨𝑛, 1o⟩] ~Q ) = (*Q‘[⟨𝑐, 1o⟩] ~Q ))
42	41	oveq2d 5790	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
43	38, 42	breq12d 3942	. . . . . . . 8 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
44	38, 41	oveq12d 5792	. . . . . . . . 9 ⊢ (𝑛 = 𝑐 → ((𝐹‘𝑛) +Q (*Q‘[⟨𝑛, 1o⟩] ~Q )) = ((𝐹‘𝑐) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
45	44	breq2d 3941	. . . . . . . 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 3933	. . . . . . 7 ⊢ (𝑘 = 𝑑 → (𝑐 <N 𝑘 ↔ 𝑐 <N 𝑑))
49		fveq2 5421	. . . . . . . . . 10 ⊢ (𝑘 = 𝑑 → (𝐹‘𝑘) = (𝐹‘𝑑))
50	49	oveq1d 5789	. . . . . . . . 9 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) = ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )))
51	50	breq2d 3941	. . . . . . . 8 ⊢ (𝑘 = 𝑑 → ((𝐹‘𝑐) <Q ((𝐹‘𝑘) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q )) ↔ (𝐹‘𝑐) <Q ((𝐹‘𝑑) +Q (*Q‘[⟨𝑐, 1o⟩] ~Q ))))
52	49	breq1d 3939	. . . . . . . 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 2665	. . . . 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 7482	. . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)))
58	1, 2, 7, 23	caucvgprlemloc 7483	. . 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 7284	. 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 2416  ∃wrex 2417  {crab 2420   ⊆ wss 3071  𝒫 cpw 3510  ⟨cop 3530   class class class wbr 3929   × cxp 4537  ⟶wf 5119  ‘cfv 5123  (class class class)co 5774  1^st c1st 6036  2^nd c2nd 6037  1_oc1o 6306  [cec 6427  Ncnpi 7080   <_N clti 7083   ~_Q ceq 7087  Qcnq 7088   +_Q cplq 7090  *_Qcrq 7092   <_Q cltq 7093  Pcnp 7099

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 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502

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 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-eprel 4211  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-irdg 6267  df-1o 6313  df-oadd 6317  df-omul 6318  df-er 6429  df-ec 6431  df-qs 6435  df-ni 7112  df-pli 7113  df-mi 7114  df-lti 7115  df-plpq 7152  df-mpq 7153  df-enq 7155  df-nqqs 7156  df-plqqs 7157  df-mqqs 7158  df-1nqqs 7159  df-rq 7160  df-ltnqqs 7161  df-inp 7274

This theorem is referenced by:  caucvgprlemladdfu  7485  caucvgprlemladdrl  7486  caucvgprlem1  7487  caucvgprlem2  7488  caucvgpr  7490