Theorem ltanq 11040

Description: Ordering property of addition for positive fractions. Proposition 9-2.6(ii) of [Gleason] p. 120. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
ltanq	⊢ (𝐶 ∈ Q → (𝐴 <Q 𝐵 ↔ (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵)))

Proof of Theorem ltanq

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addnqf 11017	. . 3 ⊢ +Q :(Q × Q)⟶Q
2	1	fdmi 6758	. 2 ⊢ dom +Q = (Q × Q)
3		ltrelnq 10995	. 2 ⊢ <Q ⊆ (Q × Q)
4		0nnq 10993	. 2 ⊢ ¬ ∅ ∈ Q
5		ordpinq 11012	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴))))
6	5	3adant3 1132	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 <Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴))))
7		elpqn 10994	. . . . . . 7 ⊢ (𝐶 ∈ Q → 𝐶 ∈ (N × N))
8	7	3ad2ant3 1135	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐶 ∈ (N × N))
9		elpqn 10994	. . . . . . 7 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N))
10	9	3ad2ant1 1133	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐴 ∈ (N × N))
11		addpipq2 11005	. . . . . 6 ⊢ ((𝐶 ∈ (N × N) ∧ 𝐴 ∈ (N × N)) → (𝐶 +pQ 𝐴) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐴))⟩)
12	8, 10, 11	syl2anc 583	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +pQ 𝐴) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐴))⟩)
13		elpqn 10994	. . . . . . 7 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N))
14	13	3ad2ant2 1134	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐵 ∈ (N × N))
15		addpipq2 11005	. . . . . 6 ⊢ ((𝐶 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐶 +pQ 𝐵) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐵))⟩)
16	8, 14, 15	syl2anc 583	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +pQ 𝐵) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐵))⟩)
17	12, 16	breq12d 5179	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐶 +pQ 𝐴) <pQ (𝐶 +pQ 𝐵) ↔ ⟨(((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐴))⟩ <pQ ⟨(((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐵))⟩))
18		addpqnq 11007	. . . . . . . 8 ⊢ ((𝐶 ∈ Q ∧ 𝐴 ∈ Q) → (𝐶 +Q 𝐴) = ([Q]‘(𝐶 +pQ 𝐴)))
19	18	ancoms 458	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐴) = ([Q]‘(𝐶 +pQ 𝐴)))
20	19	3adant2 1131	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐴) = ([Q]‘(𝐶 +pQ 𝐴)))
21		addpqnq 11007	. . . . . . . 8 ⊢ ((𝐶 ∈ Q ∧ 𝐵 ∈ Q) → (𝐶 +Q 𝐵) = ([Q]‘(𝐶 +pQ 𝐵)))
22	21	ancoms 458	. . . . . . 7 ⊢ ((𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐵) = ([Q]‘(𝐶 +pQ 𝐵)))
23	22	3adant1 1130	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐵) = ([Q]‘(𝐶 +pQ 𝐵)))
24	20, 23	breq12d 5179	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵) ↔ ([Q]‘(𝐶 +pQ 𝐴)) <Q ([Q]‘(𝐶 +pQ 𝐵))))
25		lterpq 11039	. . . . 5 ⊢ ((𝐶 +pQ 𝐴) <pQ (𝐶 +pQ 𝐵) ↔ ([Q]‘(𝐶 +pQ 𝐴)) <Q ([Q]‘(𝐶 +pQ 𝐵)))
26	24, 25	bitr4di 289	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵) ↔ (𝐶 +pQ 𝐴) <pQ (𝐶 +pQ 𝐵)))
27		xp2nd 8063	. . . . . . . . . 10 ⊢ (𝐶 ∈ (N × N) → (2nd ‘𝐶) ∈ N)
28	8, 27	syl 17	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐶) ∈ N)
29		mulclpi 10962	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N)
30	28, 28, 29	syl2anc 583	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N)
31		ltmpi 10973	. . . . . . . 8 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N → (((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)) ↔ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) <N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))))
32	30, 31	syl 17	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)) ↔ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) <N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))))
33		xp2nd 8063	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (N × N) → (2nd ‘𝐵) ∈ N)
34	14, 33	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐵) ∈ N)
35		mulclpi 10962	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ∈ N ∧ (2nd ‘𝐵) ∈ N) → ((2nd ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
36	28, 34, 35	syl2anc 583	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((2nd ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
37		xp1st 8062	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (N × N) → (1st ‘𝐶) ∈ N)
38	8, 37	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (1st ‘𝐶) ∈ N)
39		xp2nd 8063	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (N × N) → (2nd ‘𝐴) ∈ N)
40	10, 39	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐴) ∈ N)
41		mulclpi 10962	. . . . . . . . . 10 ⊢ (((1st ‘𝐶) ∈ N ∧ (2nd ‘𝐴) ∈ N) → ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N)
42	38, 40, 41	syl2anc 583	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N)
43		mulclpi 10962	. . . . . . . . 9 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ∈ N ∧ ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N) → (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N)
44	36, 42, 43	syl2anc 583	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N)
45		ltapi 10972	. . . . . . . 8 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N → ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) <N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ↔ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) <N ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))))))
46	44, 45	syl 17	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) <N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ↔ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) <N ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))))))
47	32, 46	bitrd 279	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)) ↔ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) <N ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))))))
48		mulcompi 10965	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶)))
49		fvex 6933	. . . . . . . . . . 11 ⊢ (1st ‘𝐴) ∈ V
50		fvex 6933	. . . . . . . . . . 11 ⊢ (2nd ‘𝐵) ∈ V
51		fvex 6933	. . . . . . . . . . 11 ⊢ (2nd ‘𝐶) ∈ V
52		mulcompi 10965	. . . . . . . . . . 11 ⊢ (𝑥 ·N 𝑦) = (𝑦 ·N 𝑥)
53		mulasspi 10966	. . . . . . . . . . 11 ⊢ ((𝑥 ·N 𝑦) ·N 𝑧) = (𝑥 ·N (𝑦 ·N 𝑧))
54	49, 50, 51, 52, 53, 51	caov411 7682	. . . . . . . . . 10 ⊢ (((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶))) = (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐶)))
55	48, 54	eqtri 2768	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐶)))
56	55	oveq2i 7459	. . . . . . . 8 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) = ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐶))))
57		distrpi 10967	. . . . . . . 8 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N (((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶)))) = ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐶))))
58		mulcompi 10965	. . . . . . . 8 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N (((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶)))) = ((((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵)))
59	56, 57, 58	3eqtr2i 2774	. . . . . . 7 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) = ((((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵)))
60		mulcompi 10965	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) = (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵)))
61		fvex 6933	. . . . . . . . . . 11 ⊢ (1st ‘𝐶) ∈ V
62		fvex 6933	. . . . . . . . . . 11 ⊢ (2nd ‘𝐴) ∈ V
63	61, 62, 51, 52, 53, 50	caov411 7682	. . . . . . . . . 10 ⊢ (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵)))
64	60, 63	eqtri 2768	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵)))
65		mulcompi 10965	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) = (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶)))
66		fvex 6933	. . . . . . . . . . 11 ⊢ (1st ‘𝐵) ∈ V
67	66, 62, 51, 52, 53, 51	caov411 7682	. . . . . . . . . 10 ⊢ (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))
68	65, 67	eqtri 2768	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))
69	64, 68	oveq12i 7460	. . . . . . . 8 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) = ((((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶))))
70		distrpi 10967	. . . . . . . 8 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N (((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶)))) = ((((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶))))
71		mulcompi 10965	. . . . . . . 8 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N (((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶)))) = ((((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐴)))
72	69, 70, 71	3eqtr2i 2774	. . . . . . 7 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) = ((((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐴)))
73	59, 72	breq12i 5175	. . . . . 6 ⊢ (((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) <N ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) ↔ ((((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵))) <N ((((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐴))))
74	47, 73	bitrdi 287	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)) ↔ ((((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵))) <N ((((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐴)))))
75		ordpipq 11011	. . . . 5 ⊢ (⟨(((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐴))⟩ <pQ ⟨(((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐵))⟩ ↔ ((((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵))) <N ((((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐴))))
76	74, 75	bitr4di 289	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)) ↔ ⟨(((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐴))⟩ <pQ ⟨(((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐵))⟩))
77	17, 26, 76	3bitr4rd 312	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)) ↔ (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵)))
78	6, 77	bitrd 279	. 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 <Q 𝐵 ↔ (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵)))
79	2, 3, 4, 78	ndmovord 7640	1 ⊢ (𝐶 ∈ Q → (𝐴 <Q 𝐵 ↔ (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ⟨cop 4654   class class class wbr 5166   × cxp 5698  ‘cfv 6573  (class class class)co 7448  1^st c1st 8028  2^nd c2nd 8029  Ncnpi 10913   +_N cpli 10914   ·_N cmi 10915   <_N clti 10916   +_pQ cplpq 10917   <_pQ cltpq 10919  Qcnq 10921  [Q]cerq 10923   +_Q cplq 10924   <_Q cltq 10927

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-1o 8522  df-oadd 8526  df-omul 8527  df-er 8763  df-ni 10941  df-pli 10942  df-mi 10943  df-lti 10944  df-plpq 10977  df-ltpq 10979  df-enq 10980  df-nq 10981  df-erq 10982  df-plq 10983  df-1nq 10985  df-ltnq 10987

This theorem is referenced by:  ltaddnq  11043  ltbtwnnq  11047  addclpr  11087  distrlem4pr  11095  ltexprlem3  11107  ltexprlem4  11108  ltexprlem6  11110  prlem936  11116