Theorem prplnqu 7803

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 7730	. . . . . . . 8 ⊢ (𝑄 ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P)
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P)
4		prplnqu.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ P)
5		ltaddpr 7780	. . . . . . 7 ⊢ ((⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P ∧ 𝑋 ∈ P) → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋))
6	3, 4, 5	syl2anc 411	. . . . . 6 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋))
7		addcomprg 7761	. . . . . . 7 ⊢ ((⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P ∧ 𝑋 ∈ P) → (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
8	3, 4, 7	syl2anc 411	. . . . . 6 ⊢ (𝜑 → (⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ +P 𝑋) = (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
9	6, 8	breqtrd 4108	. . . . 5 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
10		prplnqu.sum	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)))
11		addclpr 7720	. . . . . . . . 9 ⊢ ((𝑋 ∈ P ∧ ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P)
12	4, 3, 11	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P)
13		prop 7658	. . . . . . . . 9 ⊢ ((𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P → ⟨(1st ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))⟩ ∈ P)
14		elprnqu 7665	. . . . . . . . 9 ⊢ ((⟨(1st ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))⟩ ∈ P ∧ 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))) → 𝐴 ∈ Q)
15	13, 14	sylan 283	. . . . . . . 8 ⊢ (((𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P ∧ 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))) → 𝐴 ∈ Q)
16	12, 10, 15	syl2anc 411	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ Q)
17		nqpru 7735	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P) → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
18	16, 12, 17	syl2anc 411	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)) ↔ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
19	10, 18	mpbid 147	. . . . 5 ⊢ (𝜑 → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
20		ltsopr 7779	. . . . . 6 ⊢ <P Or P
21		ltrelpr 7688	. . . . . 6 ⊢ <P ⊆ (P × P)
22	20, 21	sotri 5123	. . . . 5 ⊢ ((⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∧ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
23	9, 19, 22	syl2anc 411	. . . 4 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
24		ltnqpr 7776	. . . . 5 ⊢ ((𝑄 ∈ Q ∧ 𝐴 ∈ Q) → (𝑄 <Q 𝐴 ↔ ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
25	1, 16, 24	syl2anc 411	. . . 4 ⊢ (𝜑 → (𝑄 <Q 𝐴 ↔ ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩))
26	23, 25	mpbird 167	. . 3 ⊢ (𝜑 → 𝑄 <Q 𝐴)
27		ltexnqi 7592	. . 3 ⊢ (𝑄 <Q 𝐴 → ∃𝑧 ∈ Q (𝑄 +Q 𝑧) = 𝐴)
28	26, 27	syl 14	. 2 ⊢ (𝜑 → ∃𝑧 ∈ Q (𝑄 +Q 𝑧) = 𝐴)
29	19	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
30	1	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑄 ∈ Q)
31		simprl 529	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧 ∈ Q)
32		addcomnqg 7564	. . . . . . . . . 10 ⊢ ((𝑄 ∈ Q ∧ 𝑧 ∈ Q) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
33	30, 31, 32	syl2anc 411	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
34		simprr 531	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = 𝐴)
35	33, 34	eqtr3d 2264	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 +Q 𝑄) = 𝐴)
36		breq2 4086	. . . . . . . . . 10 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → (𝑙 <Q (𝑧 +Q 𝑄) ↔ 𝑙 <Q 𝐴))
37	36	abbidv 2347	. . . . . . . . 9 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → {𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)} = {𝑙 ∣ 𝑙 <Q 𝐴})
38		breq1 4085	. . . . . . . . . 10 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → ((𝑧 +Q 𝑄) <Q 𝑢 ↔ 𝐴 <Q 𝑢))
39	38	abbidv 2347	. . . . . . . . 9 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢} = {𝑢 ∣ 𝐴 <Q 𝑢})
40	37, 39	opeq12d 3864	. . . . . . . 8 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
41	35, 40	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
42		addnqpr 7744	. . . . . . . 8 ⊢ ((𝑧 ∈ Q ∧ 𝑄 ∈ Q) → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
43	31, 30, 42	syl2anc 411	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
44	41, 43	eqtr3d 2264	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
45	29, 44	breqtrd 4108	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
46		ltaprg 7802	. . . . . . 7 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P) → (𝑓<P 𝑔 ↔ (ℎ +P 𝑓)<P (ℎ +P 𝑔)))
47	46	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P)) → (𝑓<P 𝑔 ↔ (ℎ +P 𝑓)<P (ℎ +P 𝑔)))
48	4	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋 ∈ P)
49		nqprlu 7730	. . . . . . 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 7761	. . . . . . 7 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
53	52	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
54	47, 48, 50, 51, 53	caovord2d 6174	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ ↔ (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)))
55	45, 54	mpbird 167	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩)
56		nqpru 7735	. . . . 5 ⊢ ((𝑧 ∈ Q ∧ 𝑋 ∈ P) → (𝑧 ∈ (2nd ‘𝑋) ↔ 𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩))
57	31, 48, 56	syl2anc 411	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 ∈ (2nd ‘𝑋) ↔ 𝑋<P ⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩))
58	55, 57	mpbird 167	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧 ∈ (2nd ‘𝑋))
59		oveq1 6007	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦 +Q 𝑄) = (𝑧 +Q 𝑄))
60	59	eqeq1d 2238	. . . 4 ⊢ (𝑦 = 𝑧 → ((𝑦 +Q 𝑄) = 𝐴 ↔ (𝑧 +Q 𝑄) = 𝐴))
61	60	rspcev 2907	. . 3 ⊢ ((𝑧 ∈ (2nd ‘𝑋) ∧ (𝑧 +Q 𝑄) = 𝐴) → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)
62	58, 35, 61	syl2anc 411	. 2 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)
63	28, 62	rexlimddv 2653	1 ⊢ (𝜑 → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  {cab 2215  ∃wrex 2509  ⟨cop 3669   class class class wbr 4082  ‘cfv 5317  (class class class)co 6000  1^st c1st 6282  2^nd c2nd 6283  Qcnq 7463   +_Q cplq 7465   <_Q cltq 7468  Pcnp 7474   +_P cpp 7476  <_P cltp 7478

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 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  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-ne 2401  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-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-eprel 4379  df-id 4383  df-po 4386  df-iso 4387  df-iord 4456  df-on 4458  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-irdg 6514  df-1o 6560  df-2o 6561  df-oadd 6564  df-omul 6565  df-er 6678  df-ec 6680  df-qs 6684  df-ni 7487  df-pli 7488  df-mi 7489  df-lti 7490  df-plpq 7527  df-mpq 7528  df-enq 7530  df-nqqs 7531  df-plqqs 7532  df-mqqs 7533  df-1nqqs 7534  df-rq 7535  df-ltnqqs 7536  df-enq0 7607  df-nq0 7608  df-0nq0 7609  df-plq0 7610  df-mq0 7611  df-inp 7649  df-iplp 7651  df-iltp 7653

This theorem is referenced by:  caucvgprprlemexbt  7889