genpdisj - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > genpdisj		GIF version

Theorem genpdisj 7742

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 (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
genpelvl.2	⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
genpdisj.ord	⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 <_Q 𝑦 ↔ (𝑧𝐺𝑥) <_Q (𝑧𝐺𝑦)))
genpdisj.com	⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥𝐺𝑦) = (𝑦𝐺𝑥))

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

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 (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
2		genpelvl.2	. . . . . . . . 9 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
3	1, 2	genpelvl 7731	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑎 ∈ (1^st ‘𝐴)∃𝑏 ∈ (1^st ‘𝐵)𝑞 = (𝑎𝐺𝑏)))
4		r2ex 2552	. . . . . . . 8 ⊢ (∃𝑎 ∈ (1^st ‘𝐴)∃𝑏 ∈ (1^st ‘𝐵)𝑞 = (𝑎𝐺𝑏) ↔ ∃𝑎∃𝑏((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)))
5	3, 4	bitrdi 196	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑎∃𝑏((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏))))
6	1, 2	genpelvu 7732	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑐 ∈ (2^nd ‘𝐴)∃𝑑 ∈ (2^nd ‘𝐵)𝑞 = (𝑐𝐺𝑑)))
7		r2ex 2552	. . . . . . . 8 ⊢ (∃𝑐 ∈ (2^nd ‘𝐴)∃𝑑 ∈ (2^nd ‘𝐵)𝑞 = (𝑐𝐺𝑑) ↔ ∃𝑐∃𝑑((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))
8	6, 7	bitrdi 196	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑐∃𝑑((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
9	5, 8	anbi12d 473	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵))) ↔ (∃𝑎∃𝑏((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ∃𝑐∃𝑑((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))))
10		ee4anv 1987	. . . . . 6 ⊢ (∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) ↔ (∃𝑎∃𝑏((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ∃𝑐∃𝑑((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
11	9, 10	bitr4di 198	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵))) ↔ ∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))))
12	11	biimpa 296	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) → ∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))))
13		an4 588	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑐 ∈ (2^nd ‘𝐴)) ∧ (𝑏 ∈ (1^st ‘𝐵) ∧ 𝑑 ∈ (2^nd ‘𝐵))) ↔ ((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ (𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵))))
14		prop 7694	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
15		prltlu 7706	. . . . . . . . . . . . . . . . 17 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑎 ∈ (1^st ‘𝐴) ∧ 𝑐 ∈ (2^nd ‘𝐴)) → 𝑎 <_Q 𝑐)
16	15	3expib 1232	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P → ((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑐 ∈ (2^nd ‘𝐴)) → 𝑎 <_Q 𝑐))
17	14, 16	syl 14	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ P → ((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑐 ∈ (2^nd ‘𝐴)) → 𝑎 <_Q 𝑐))
18		prop 7694	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
19		prltlu 7706	. . . . . . . . . . . . . . . . 17 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ 𝑏 ∈ (1^st ‘𝐵) ∧ 𝑑 ∈ (2^nd ‘𝐵)) → 𝑏 <_Q 𝑑)
20	19	3expib 1232	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P → ((𝑏 ∈ (1^st ‘𝐵) ∧ 𝑑 ∈ (2^nd ‘𝐵)) → 𝑏 <_Q 𝑑))
21	18, 20	syl 14	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ P → ((𝑏 ∈ (1^st ‘𝐵) ∧ 𝑑 ∈ (2^nd ‘𝐵)) → 𝑏 <_Q 𝑑))
22	17, 21	im2anan9 602	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑐 ∈ (2^nd ‘𝐴)) ∧ (𝑏 ∈ (1^st ‘𝐵) ∧ 𝑑 ∈ (2^nd ‘𝐵))) → (𝑎 <_Q 𝑐 ∧ 𝑏 <_Q 𝑑)))
23		genpdisj.ord	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 <_Q 𝑦 ↔ (𝑧𝐺𝑥) <_Q (𝑧𝐺𝑦)))
24		genpdisj.com	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥𝐺𝑦) = (𝑦𝐺𝑥))
25	23, 24	genplt2i 7729	. . . . . . . . . . . . . 14 ⊢ ((𝑎 <_Q 𝑐 ∧ 𝑏 <_Q 𝑑) → (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑))
26	22, 25	syl6 33	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑐 ∈ (2^nd ‘𝐴)) ∧ (𝑏 ∈ (1^st ‘𝐵) ∧ 𝑑 ∈ (2^nd ‘𝐵))) → (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑)))
27	13, 26	biimtrrid 153	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ (𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵))) → (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑)))
28	27	imp 124	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ (𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)))) → (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑))
29	28	adantlr 477	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) ∧ ((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ (𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)))) → (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑))
30	29	adantrlr 485	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ (𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)))) → (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑))
31	30	adantrrr 487	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑))
32		eqtr2 2250	. . . . . . . . . . 11 ⊢ ((𝑞 = (𝑎𝐺𝑏) ∧ 𝑞 = (𝑐𝐺𝑑)) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
33	32	ad2ant2l 508	. . . . . . . . . 10 ⊢ ((((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
34	33	adantl 277	. . . . . . . . 9 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → (𝑎𝐺𝑏) = (𝑐𝐺𝑑))
35		ltsonq 7617	. . . . . . . . . . 11 ⊢ <_Q Or Q
36		ltrelnq 7584	. . . . . . . . . . 11 ⊢ <_Q ⊆ (Q × Q)
37	35, 36	soirri 5131	. . . . . . . . . 10 ⊢ ¬ (𝑎𝐺𝑏) <_Q (𝑎𝐺𝑏)
38		breq2 4092	. . . . . . . . . 10 ⊢ ((𝑎𝐺𝑏) = (𝑐𝐺𝑑) → ((𝑎𝐺𝑏) <_Q (𝑎𝐺𝑏) ↔ (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑)))
39	37, 38	mtbii 680	. . . . . . . . 9 ⊢ ((𝑎𝐺𝑏) = (𝑐𝐺𝑑) → ¬ (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑))
40	34, 39	syl 14	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → ¬ (𝑎𝐺𝑏) <_Q (𝑐𝐺𝑑))
41	31, 40	pm2.21fal 1417	. . . . . . 7 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) ∧ (((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑)))) → ⊥)
42	41	ex 115	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) → ((((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
43	42	exlimdvv 1946	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) → (∃𝑐∃𝑑(((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
44	43	exlimdvv 1946	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) → (∃𝑎∃𝑏∃𝑐∃𝑑(((𝑎 ∈ (1^st ‘𝐴) ∧ 𝑏 ∈ (1^st ‘𝐵)) ∧ 𝑞 = (𝑎𝐺𝑏)) ∧ ((𝑐 ∈ (2^nd ‘𝐴) ∧ 𝑑 ∈ (2^nd ‘𝐵)) ∧ 𝑞 = (𝑐𝐺𝑑))) → ⊥))
45	12, 44	mpd 13	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵)))) → ⊥)
46	45	inegd 1416	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ¬ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵))))
47	46	ralrimivw 2606	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴𝐹𝐵))))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 = wceq 1397 ⊥wfal 1402 ∃wex 1540 ∈ wcel 2202 ∀wral 2510 ∃wrex 2511 {crab 2514 ⟨cop 3672 class class class wbr 4088 ‘cfv 5326 (class class class)co 6017 ∈ cmpo 6019 1^st c1st 6300 2^nd c2nd 6301 Qcnq 7499 <_Q cltq 7504 Pcnp 7510

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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686

This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-eprel 4386 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-irdg 6535 df-oadd 6585 df-omul 6586 df-er 6701 df-ec 6703 df-qs 6707 df-ni 7523 df-mi 7525 df-lti 7526 df-enq 7566 df-nqqs 7567 df-ltnqqs 7572 df-inp 7685

This theorem is referenced by: addclpr 7756 mulclpr 7791

W3C validator