Theorem prplnqu 6718

Description: Membership in the upper cut of a sum of a positive real and a fraction. (Contributed by Jim Kingdon, 16-Jun-2021.)

Hypotheses

Ref	Expression
prplnqu.x	⊢ (𝜑 → 𝑋 ∈ P)
prplnqu.q	⊢ (𝜑 → 𝑄 ∈ Q)
prplnqu.sum	⊢ (𝜑 → 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)))

Assertion

Ref	Expression
prplnqu	⊢ (𝜑 → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)

Distinct variable groups:   𝐴,𝑙,𝑢   𝑦,𝐴   𝑄,𝑙,𝑢   𝑦,𝑄   𝑦,𝑋

Allowed substitution hints:   𝜑(𝑦,𝑢,𝑙)   𝑋(𝑢,𝑙)

Proof of Theorem prplnqu

Dummy variables 𝑓 𝑔 ℎ 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prplnqu.q	. . . . . . . 8 ⊢ (𝜑 → 𝑄 ∈ Q)
2		nqprlu 6645	. . . . . . . 8 ⊢ (𝑄 ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P)
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P)
4		prplnqu.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ P)
5		ltaddpr 6695	. . . . . . 7 ⊢ ((⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P ∧ 𝑋 ∈ P) → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋))
6	3, 4, 5	syl2anc 391	. . . . . 6 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋))
7		addcomprg 6676	. . . . . . 7 ⊢ ((⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P ∧ 𝑋 ∈ P) → (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
8	3, 4, 7	syl2anc 391	. . . . . 6 ⊢ (𝜑 → (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
9	6, 8	breqtrd 3788	. . . . 5 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
10		prplnqu.sum	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)))
11		addclpr 6635	. . . . . . . . 9 ⊢ ((𝑋 ∈ P ∧ ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P)
12	4, 3, 11	syl2anc 391	. . . . . . . 8 ⊢ (𝜑 → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P)
13		prop 6573	. . . . . . . . 9 ⊢ ((𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P → ⟨(1st ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))⟩ ∈ P)
14		elprnqu 6580	. . . . . . . . 9 ⊢ ((⟨(1st ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))⟩ ∈ P ∧ 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))) → 𝐴 ∈ Q)
15	13, 14	sylan 267	. . . . . . . 8 ⊢ (((𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P ∧ 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))) → 𝐴 ∈ Q)
16	12, 10, 15	syl2anc 391	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ Q)
17		nqpru 6650	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P) → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
18	16, 12, 17	syl2anc 391	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
19	10, 18	mpbid 135	. . . . 5 ⊢ (𝜑 → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
20		ltsopr 6694	. . . . . 6 ⊢ <P Or P
21		ltrelpr 6603	. . . . . 6 ⊢ <P ⊆ (P × P)
22	20, 21	sotri 4720	. . . . 5 ⊢ ((⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∧ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
23	9, 19, 22	syl2anc 391	. . . 4 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
24		ltnqpr 6691	. . . . 5 ⊢ ((𝑄 ∈ Q ∧ 𝐴 ∈ Q) → (𝑄 <Q 𝐴 ↔ ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
25	1, 16, 24	syl2anc 391	. . . 4 ⊢ (𝜑 → (𝑄 <Q 𝐴 ↔ ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
26	23, 25	mpbird 156	. . 3 ⊢ (𝜑 → 𝑄 <Q 𝐴)
27		ltexnqi 6507	. . 3 ⊢ (𝑄 <Q 𝐴 → ∃𝑧 ∈ Q (𝑄 +Q 𝑧) = 𝐴)
28	26, 27	syl 14	. 2 ⊢ (𝜑 → ∃𝑧 ∈ Q (𝑄 +Q 𝑧) = 𝐴)
29	19	adantr 261	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
30	1	adantr 261	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑄 ∈ Q)
31		simprl 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧 ∈ Q)
32		addcomnqg 6479	. . . . . . . . . 10 ⊢ ((𝑄 ∈ Q ∧ 𝑧 ∈ Q) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
33	30, 31, 32	syl2anc 391	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
34		simprr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = 𝐴)
35	33, 34	eqtr3d 2074	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 +Q 𝑄) = 𝐴)
36		breq2 3768	. . . . . . . . . 10 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → (𝑙 <Q (𝑧 +Q 𝑄) ↔ 𝑙 <Q 𝐴))
37	36	abbidv 2155	. . . . . . . . 9 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → {𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)} = {𝑙 ∣ 𝑙 <Q 𝐴})
38		breq1 3767	. . . . . . . . . 10 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → ((𝑧 +Q 𝑄) <Q 𝑢 ↔ 𝐴 <Q 𝑢))
39	38	abbidv 2155	. . . . . . . . 9 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢} = {𝑢 ∣ 𝐴 <Q 𝑢})
40	37, 39	opeq12d 3557	. . . . . . . 8 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
41	35, 40	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
42		addnqpr 6659	. . . . . . . 8 ⊢ ((𝑧 ∈ Q ∧ 𝑄 ∈ Q) → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
43	31, 30, 42	syl2anc 391	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
44	41, 43	eqtr3d 2074	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
45	29, 44	breqtrd 3788	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
46		ltaprg 6717	. . . . . . 7 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P) → (𝑓<P 𝑔 ↔ (ℎ +P 𝑓)<P (ℎ +P 𝑔)))
47	46	adantl 262	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P)) → (𝑓<P 𝑔 ↔ (ℎ +P 𝑓)<P (ℎ +P 𝑔)))
48	4	adantr 261	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋 ∈ P)
49		nqprlu 6645	. . . . . . 7 ⊢ (𝑧 ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ ∈ P)
50	31, 49	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ ∈ P)
51	30, 2	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P)
52		addcomprg 6676	. . . . . . 7 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
53	52	adantl 262	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
54	47, 48, 50, 51, 53	caovord2d 5670	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ ↔ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)))
55	45, 54	mpbird 156	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩)
56		nqpru 6650	. . . . 5 ⊢ ((𝑧 ∈ Q ∧ 𝑋 ∈ P) → (𝑧 ∈ (2nd ‘𝑋) ↔ 𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩))
57	31, 48, 56	syl2anc 391	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 ∈ (2nd ‘𝑋) ↔ 𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩))
58	55, 57	mpbird 156	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧 ∈ (2nd ‘𝑋))
59		oveq1 5519	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦 +Q 𝑄) = (𝑧 +Q 𝑄))
60	59	eqeq1d 2048	. . . 4 ⊢ (𝑦 = 𝑧 → ((𝑦 +Q 𝑄) = 𝐴 ↔ (𝑧 +Q 𝑄) = 𝐴))
61	60	rspcev 2656	. . 3 ⊢ ((𝑧 ∈ (2nd ‘𝑋) ∧ (𝑧 +Q 𝑄) = 𝐴) → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)
62	58, 35, 61	syl2anc 391	. 2 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)
63	28, 62	rexlimddv 2437	1 ⊢ (𝜑 → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   ∧ w3a 885   = wceq 1243   ∈ wcel 1393  {cab 2026  ∃wrex 2307  ⟨cop 3378   class class class wbr 3764  ‘cfv 4902  (class class class)co 5512  1^st c1st 5765  2^nd c2nd 5766  Qcnq 6378   +_Q cplq 6380   <_Q cltq 6383  Pcnp 6389   +_P cpp 6391  <_P cltp 6393

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311

This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-2o 6002  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-lti 6405  df-plpq 6442  df-mpq 6443  df-enq 6445  df-nqqs 6446  df-plqqs 6447  df-mqqs 6448  df-1nqqs 6449  df-rq 6450  df-ltnqqs 6451  df-enq0 6522  df-nq0 6523  df-0nq0 6524  df-plq0 6525  df-mq0 6526  df-inp 6564  df-iplp 6566  df-iltp 6568

This theorem is referenced by:  caucvgprprlemexbt  6804