Theorem prplnqu 7883

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 7810	. . . . . . . 8 ⊢ (𝑄 ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P)
3	1, 2	syl 14	. . . . . . 7 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P)
4		prplnqu.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ P)
5		ltaddpr 7860	. . . . . . 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 7841	. . . . . . 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 4119	. . . . 5 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩<P (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
10		prplnqu.sum	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)))
11		addclpr 7800	. . . . . . . . 9 ⊢ ((𝑋 ∈ P ∧ ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩ ∈ P) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P)
12	4, 3, 11	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P)
13		prop 7738	. . . . . . . . 9 ⊢ ((𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩) ∈ P → ⟨(1st ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)), (2nd ‘(𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))⟩ ∈ P)
14		elprnqu 7745	. . . . . . . . 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 7815	. . . . . . 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 7859	. . . . . 6 ⊢ <P Or P
21		ltrelpr 7768	. . . . . 6 ⊢ <P ⊆ (P × P)
22	20, 21	sotri 5139	. . . . 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 7856	. . . . 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 7672	. . 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 531	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → 𝑧 ∈ Q)
32		addcomnqg 7644	. . . . . . . . . 10 ⊢ ((𝑄 ∈ Q ∧ 𝑧 ∈ Q) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
33	30, 31, 32	syl2anc 411	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = (𝑧 +Q 𝑄))
34		simprr 533	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑄 +Q 𝑧) = 𝐴)
35	33, 34	eqtr3d 2266	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑧 +Q 𝑄) = 𝐴)
36		breq2 4097	. . . . . . . . . 10 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → (𝑙 <Q (𝑧 +Q 𝑄) ↔ 𝑙 <Q 𝐴))
37	36	abbidv 2350	. . . . . . . . 9 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → {𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)} = {𝑙 ∣ 𝑙 <Q 𝐴})
38		breq1 4096	. . . . . . . . . 10 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → ((𝑧 +Q 𝑄) <Q 𝑢 ↔ 𝐴 <Q 𝑢))
39	38	abbidv 2350	. . . . . . . . 9 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢} = {𝑢 ∣ 𝐴 <Q 𝑢})
40	37, 39	opeq12d 3875	. . . . . . . 8 ⊢ ((𝑧 +Q 𝑄) = 𝐴 → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
41	35, 40	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q (𝑧 +Q 𝑄)}, {𝑢 ∣ (𝑧 +Q 𝑄) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩)
42		addnqpr 7824	. . . . . . . 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 2266	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
45	29, 44	breqtrd 4119	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → (𝑋 +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩)<P (⟨{𝑙 ∣ 𝑙 <Q 𝑧}, {𝑢 ∣ 𝑧 <Q 𝑢}⟩ +P ⟨{𝑙 ∣ 𝑙 <Q 𝑄}, {𝑢 ∣ 𝑄 <Q 𝑢}⟩))
46		ltaprg 7882	. . . . . . 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 7810	. . . . . . 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 7841	. . . . . . 7 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
53	52	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
54	47, 48, 50, 51, 53	caovord2d 6202	. . . . 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 7815	. . . . 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 6035	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦 +Q 𝑄) = (𝑧 +Q 𝑄))
60	59	eqeq1d 2240	. . . 4 ⊢ (𝑦 = 𝑧 → ((𝑦 +Q 𝑄) = 𝐴 ↔ (𝑧 +Q 𝑄) = 𝐴))
61	60	rspcev 2911	. . 3 ⊢ ((𝑧 ∈ (2nd ‘𝑋) ∧ (𝑧 +Q 𝑄) = 𝐴) → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)
62	58, 35, 61	syl2anc 411	. 2 ⊢ ((𝜑 ∧ (𝑧 ∈ Q ∧ (𝑄 +Q 𝑧) = 𝐴)) → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)
63	28, 62	rexlimddv 2656	1 ⊢ (𝜑 → ∃𝑦 ∈ (2nd ‘𝑋)(𝑦 +Q 𝑄) = 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2202  {cab 2217  ∃wrex 2512  ⟨cop 3676   class class class wbr 4093  ‘cfv 5333  (class class class)co 6028  1^st c1st 6310  2^nd c2nd 6311  Qcnq 7543   +_Q cplq 7545   <_Q cltq 7548  Pcnp 7554   +_P cpp 7556  <_P cltp 7558

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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692

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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-2o 6626  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616  df-enq0 7687  df-nq0 7688  df-0nq0 7689  df-plq0 7690  df-mq0 7691  df-inp 7729  df-iplp 7731  df-iltp 7733

This theorem is referenced by:  caucvgprprlemexbt  7969