Theorem genpdisj 7513

Description: The lower and upper cuts produced by addition or multiplication on positive reals are disjoint. (Contributed by Jim Kingdon, 15-Oct-2019.)

Hypotheses

Ref	Expression
genpelvl.1	⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1st ‘𝑤) ∧ 𝑧 ∈ (1st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2nd ‘𝑤) ∧ 𝑧 ∈ (2nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
genpelvl.2	⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
genpdisj.ord	⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 <Q 𝑦 ↔ (𝑧𝐺𝑥) <Q (𝑧𝐺𝑦)))
genpdisj.com	⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥𝐺𝑦) = (𝑦𝐺𝑥))

Assertion

Ref	Expression
genpdisj	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑞,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑞   𝑥,𝐺,𝑦,𝑧,𝑤,𝑣,𝑞   𝐹,𝑞

Allowed substitution hints:   𝐹(𝑥,𝑦,𝑧,𝑤,𝑣)

Proof of Theorem genpdisj

Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		genpelvl.1	. . . . . . . . 9 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1st ‘𝑤) ∧ 𝑧 ∈ (1st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2nd ‘𝑤) ∧ 𝑧 ∈ (2nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
2		genpelvl.2	. . . . . . . . 9 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
3	1, 2	genpelvl 7502	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ↔ ∃𝑎 ∈ (1st ‘𝐴)∃𝑏 ∈ (1st ‘𝐵)𝑞 = (𝑎𝐺𝑏)))
4		r2ex 2497	. . . . . . . 8 ⊢ (∃𝑎 ∈ (1st ‘𝐴)∃𝑏 ∈ (1st ‘𝐵)𝑞 = (𝑎𝐺𝑏) ↔ ∃𝑎∃𝑏((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)))
5	3, 4	bitrdi 196	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ↔ ∃𝑎∃𝑏((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏))))
6	1, 2	genpelvu 7503	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑐 ∈ (2nd ‘𝐴)∃𝑑 ∈ (2nd ‘𝐵)𝑞 = (𝑐𝐺𝑑)))
7		r2ex 2497	. . . . . . . 8 ⊢ (∃𝑐 ∈ (2nd ‘𝐴)∃𝑑 ∈ (2nd ‘𝐵)𝑞 = (𝑐𝐺𝑑) ↔ ∃𝑐∃𝑑((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))
8	6, 7	bitrdi 196	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑐∃𝑑((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
9	5, 8	anbi12d 473	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))) ↔ (∃𝑎∃𝑏((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ∃𝑐∃𝑑((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))))
10		ee4anv 1934	. . . . . 6 ⊢ (∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) ↔ (∃𝑎∃𝑏((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ∃𝑐∃𝑑((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
11	9, 10	bitr4di 198	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))) ↔ ∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))))
12	11	biimpa 296	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → ∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
13		an4 586	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑐 ∈ (2nd ‘𝐴)) ∧ (𝑏 ∈ (1st ‘𝐵) ∧ 𝑑 ∈ (2nd ‘𝐵))) ↔ ((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ (𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵))))
14		prop 7465	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
15		prltlu 7477	. . . . . . . . . . . . . . . . 17 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑎 ∈ (1st ‘𝐴) ∧ 𝑐 ∈ (2nd ‘𝐴)) → 𝑎 <Q 𝑐)
16	15	3expib 1206	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P → ((𝑎 ∈ (1st ‘𝐴) ∧ 𝑐 ∈ (2nd ‘𝐴)) → 𝑎 <Q 𝑐))
17	14, 16	syl 14	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ P → ((𝑎 ∈ (1st ‘𝐴) ∧ 𝑐 ∈ (2nd ‘𝐴)) → 𝑎 <Q 𝑐))
18		prop 7465	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
19		prltlu 7477	. . . . . . . . . . . . . . . . 17 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ 𝑏 ∈ (1st ‘𝐵) ∧ 𝑑 ∈ (2nd ‘𝐵)) → 𝑏 <Q 𝑑)
20	19	3expib 1206	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P → ((𝑏 ∈ (1st ‘𝐵) ∧ 𝑑 ∈ (2nd ‘𝐵)) → 𝑏 <Q 𝑑))
21	18, 20	syl 14	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ P → ((𝑏 ∈ (1st ‘𝐵) ∧ 𝑑 ∈ (2nd ‘𝐵)) → 𝑏 <Q 𝑑))
22	17, 21	im2anan9 598	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑐 ∈ (2nd ‘𝐴)) ∧ (𝑏 ∈ (1st ‘𝐵) ∧ 𝑑 ∈ (2nd ‘𝐵))) → (𝑎 <Q 𝑐 ∧ 𝑏 <Q 𝑑)))
23		genpdisj.ord	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 <Q 𝑦 ↔ (𝑧𝐺𝑥) <Q (𝑧𝐺𝑦)))
24		genpdisj.com	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥𝐺𝑦) = (𝑦𝐺𝑥))
25	23, 24	genplt2i 7500	. . . . . . . . . . . . . 14 ⊢ ((𝑎 <Q 𝑐 ∧ 𝑏 <Q 𝑑) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
26	22, 25	syl6 33	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑐 ∈ (2nd ‘𝐴)) ∧ (𝑏 ∈ (1st ‘𝐵) ∧ 𝑑 ∈ (2nd ‘𝐵))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑)))
27	13, 26	biimtrrid 153	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ (𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑)))
28	27	imp 124	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ (𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
29	28	adantlr 477	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ ((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ (𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
30	29	adantrlr 485	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ (𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
31	30	adantrrr 487	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
32		eqtr2 2196	. . . . . . . . . . 11 ⊢ ((𝑞 = (𝑎𝐺𝑏) ∧ 𝑞 = (𝑐𝐺𝑑)) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
33	32	ad2ant2l 508	. . . . . . . . . 10 ⊢ ((((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
34	33	adantl 277	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
35		ltsonq 7388	. . . . . . . . . . 11 ⊢ <Q Or Q
36		ltrelnq 7355	. . . . . . . . . . 11 ⊢ <Q ⊆ (Q × Q)
37	35, 36	soirri 5019	. . . . . . . . . 10 ⊢ ¬ (𝑎𝐺𝑏) <Q (𝑎𝐺𝑏)
38		breq2 4004	. . . . . . . . . 10 ⊢ ((𝑎𝐺𝑏) = (𝑐𝐺𝑑) → ((𝑎𝐺𝑏) <Q (𝑎𝐺𝑏) ↔ (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑)))
39	37, 38	mtbii 674	. . . . . . . . 9 ⊢ ((𝑎𝐺𝑏) = (𝑐𝐺𝑑) → ¬ (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
40	34, 39	syl 14	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → ¬ (𝑎𝐺𝑏) <Q (𝑐𝐺𝑑))
41	31, 40	pm2.21fal 1373	. . . . . . 7 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → ⊥)
42	41	ex 115	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → ((((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
43	42	exlimdvv 1897	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → (∃𝑐∃𝑑(((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
44	43	exlimdvv 1897	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → (∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1st ‘𝐴) ∧ 𝑏 ∈ (1st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2nd ‘𝐴) ∧ 𝑑 ∈ (2nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
45	12, 44	mpd 13	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))) → ⊥)
46	45	inegd 1372	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ¬ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))))
47	46	ralrimivw 2551	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 978   = wceq 1353  ⊥wfal 1358  ∃wex 1492   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  {crab 2459  ⟨cop 3594   class class class wbr 4000  ‘cfv 5212  (class class class)co 5869   ∈ cmpo 5871  1^st c1st 6133  2^nd c2nd 6134  Qcnq 7270   <_Q cltq 7275  Pcnp 7281

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-eprel 4286  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-irdg 6365  df-oadd 6415  df-omul 6416  df-er 6529  df-ec 6531  df-qs 6535  df-ni 7294  df-mi 7296  df-lti 7297  df-enq 7337  df-nqqs 7338  df-ltnqqs 7343  df-inp 7456

This theorem is referenced by:  addclpr  7527  mulclpr  7562