Theorem caucvgprprlemell 7880

Description: Lemma for caucvgprpr 7907. Membership in the lower cut of the putative limit. (Contributed by Jim Kingdon, 21-Jan-2021.)

Hypothesis

Ref	Expression
caucvgprprlemell.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
caucvgprprlemell	⊢ (𝑋 ∈ (1st ‘𝐿) ↔ (𝑋 ∈ Q ∧ ∃𝑏 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑏)))

Distinct variable groups:   𝐹,𝑏   𝐹,𝑙,𝑟   𝑢,𝐹,𝑟   𝑋,𝑏,𝑝   𝑋,𝑙,𝑟,𝑝   𝑢,𝑋,𝑝   𝑋,𝑞,𝑏   𝑞,𝑙,𝑟   𝑢,𝑞

Allowed substitution hints:   𝐹(𝑞,𝑝)   𝐿(𝑢,𝑟,𝑞,𝑝,𝑏,𝑙)

Proof of Theorem caucvgprprlemell

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 6014	. . . . . . . 8 ⊢ (𝑙 = 𝑋 → (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) = (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )))
2	1	breq2d 4095	. . . . . . 7 ⊢ (𝑙 = 𝑋 → (𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) ↔ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))))
3	2	abbidv 2347	. . . . . 6 ⊢ (𝑙 = 𝑋 → {𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))} = {𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))})
4	1	breq1d 4093	. . . . . . 7 ⊢ (𝑙 = 𝑋 → ((𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞 ↔ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞))
5	4	abbidv 2347	. . . . . 6 ⊢ (𝑙 = 𝑋 → {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞} = {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞})
6	3, 5	opeq12d 3865	. . . . 5 ⊢ (𝑙 = 𝑋 → ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩)
7	6	breq1d 4093	. . . 4 ⊢ (𝑙 = 𝑋 → (⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)))
8	7	rexbidv 2531	. . 3 ⊢ (𝑙 = 𝑋 → (∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)))
9		caucvgprprlemell.lim	. . . . 5 ⊢ 𝐿 = ⟨{𝑙 ∈ 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 𝑞}⟩}⟩
10	9	fveq2i 5632	. . . 4 ⊢ (1st ‘𝐿) = (1st ‘⟨{𝑙 ∈ 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 𝑞}⟩}⟩)
11		nqex 7558	. . . . . 6 ⊢ Q ∈ V
12	11	rabex 4228	. . . . 5 ⊢ {𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)} ∈ V
13	11	rabex 4228	. . . . 5 ⊢ {𝑢 ∈ Q ∣ ∃𝑟 ∈ N ((𝐹‘𝑟) +P ⟨{𝑝 ∣ 𝑝 <Q (*Q‘[⟨𝑟, 1o⟩] ~Q )}, {𝑞 ∣ (*Q‘[⟨𝑟, 1o⟩] ~Q ) <Q 𝑞}⟩)<P ⟨{𝑝 ∣ 𝑝 <Q 𝑢}, {𝑞 ∣ 𝑢 <Q 𝑞}⟩} ∈ V
14	12, 13	op1st 6298	. . . 4 ⊢ (1st ‘⟨{𝑙 ∈ 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 ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}
15	10, 14	eqtri 2250	. . 3 ⊢ (1st ‘𝐿) = {𝑙 ∈ Q ∣ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑙 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)}
16	8, 15	elrab2 2962	. 2 ⊢ (𝑋 ∈ (1st ‘𝐿) ↔ (𝑋 ∈ Q ∧ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)))
17		opeq1 3857	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑎 → ⟨𝑟, 1o⟩ = ⟨𝑎, 1o⟩)
18	17	eceq1d 6724	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑎 → [⟨𝑟, 1o⟩] ~Q = [⟨𝑎, 1o⟩] ~Q )
19	18	fveq2d 5633	. . . . . . . . . 10 ⊢ (𝑟 = 𝑎 → (*Q‘[⟨𝑟, 1o⟩] ~Q ) = (*Q‘[⟨𝑎, 1o⟩] ~Q ))
20	19	oveq2d 6023	. . . . . . . . 9 ⊢ (𝑟 = 𝑎 → (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) = (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
21	20	breq2d 4095	. . . . . . . 8 ⊢ (𝑟 = 𝑎 → (𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) ↔ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))))
22	21	abbidv 2347	. . . . . . 7 ⊢ (𝑟 = 𝑎 → {𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))} = {𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))})
23	20	breq1d 4093	. . . . . . . 8 ⊢ (𝑟 = 𝑎 → ((𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞 ↔ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞))
24	23	abbidv 2347	. . . . . . 7 ⊢ (𝑟 = 𝑎 → {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞} = {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞})
25	22, 24	opeq12d 3865	. . . . . 6 ⊢ (𝑟 = 𝑎 → ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩)
26		fveq2 5629	. . . . . 6 ⊢ (𝑟 = 𝑎 → (𝐹‘𝑟) = (𝐹‘𝑎))
27	25, 26	breq12d 4096	. . . . 5 ⊢ (𝑟 = 𝑎 → (⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑎)))
28	27	cbvrexv 2766	. . . 4 ⊢ (∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ∃𝑎 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑎))
29		opeq1 3857	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑏 → ⟨𝑎, 1o⟩ = ⟨𝑏, 1o⟩)
30	29	eceq1d 6724	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑏 → [⟨𝑎, 1o⟩] ~Q = [⟨𝑏, 1o⟩] ~Q )
31	30	fveq2d 5633	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → (*Q‘[⟨𝑎, 1o⟩] ~Q ) = (*Q‘[⟨𝑏, 1o⟩] ~Q ))
32	31	oveq2d 6023	. . . . . . . . 9 ⊢ (𝑎 = 𝑏 → (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) = (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )))
33	32	breq2d 4095	. . . . . . . 8 ⊢ (𝑎 = 𝑏 → (𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) ↔ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))))
34	33	abbidv 2347	. . . . . . 7 ⊢ (𝑎 = 𝑏 → {𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))} = {𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))})
35	32	breq1d 4093	. . . . . . . 8 ⊢ (𝑎 = 𝑏 → ((𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞 ↔ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞))
36	35	abbidv 2347	. . . . . . 7 ⊢ (𝑎 = 𝑏 → {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞} = {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞})
37	34, 36	opeq12d 3865	. . . . . 6 ⊢ (𝑎 = 𝑏 → ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩ = ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞}⟩)
38		fveq2 5629	. . . . . 6 ⊢ (𝑎 = 𝑏 → (𝐹‘𝑎) = (𝐹‘𝑏))
39	37, 38	breq12d 4096	. . . . 5 ⊢ (𝑎 = 𝑏 → (⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑎) ↔ ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑏)))
40	39	cbvrexv 2766	. . . 4 ⊢ (∃𝑎 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑎, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑎) ↔ ∃𝑏 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑏))
41	28, 40	bitri 184	. . 3 ⊢ (∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟) ↔ ∃𝑏 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑏))
42	41	anbi2i 457	. 2 ⊢ ((𝑋 ∈ Q ∧ ∃𝑟 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑟, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑟)) ↔ (𝑋 ∈ Q ∧ ∃𝑏 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑏)))
43	16, 42	bitri 184	1 ⊢ (𝑋 ∈ (1st ‘𝐿) ↔ (𝑋 ∈ Q ∧ ∃𝑏 ∈ N ⟨{𝑝 ∣ 𝑝 <Q (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q ))}, {𝑞 ∣ (𝑋 +Q (*Q‘[⟨𝑏, 1o⟩] ~Q )) <Q 𝑞}⟩<P (𝐹‘𝑏)))

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1395   ∈ wcel 2200  {cab 2215  ∃wrex 2509  {crab 2512  ⟨cop 3669   class class class wbr 4083  ‘cfv 5318  (class class class)co 6007  1^st c1st 6290  1_oc1o 6561  [cec 6686  Ncnpi 7467   ~_Q ceq 7474  Qcnq 7475   +_Q cplq 7477  *_Qcrq 7479   <_Q cltq 7480   +_P cpp 7488  <_P cltp 7490

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-iinf 4680

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-1st 6292  df-ec 6690  df-qs 6694  df-ni 7499  df-nqqs 7543

This theorem is referenced by:  caucvgprprlemopl  7892  caucvgprprlemlol  7893  caucvgprprlemdisj  7897  caucvgprprlemloc  7898