Theorem ltanq 10966

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 10943	. . 3 ⊢ +Q :(Q × Q)⟶Q
2	1	fdmi 6730	. 2 ⊢ dom +Q = (Q × Q)
3		ltrelnq 10921	. 2 ⊢ <Q ⊆ (Q × Q)
4		0nnq 10919	. 2 ⊢ ¬ ∅ ∈ Q
5		ordpinq 10938	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴))))
6	5	3adant3 1133	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 <Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴))))
7		elpqn 10920	. . . . . . 7 ⊢ (𝐶 ∈ Q → 𝐶 ∈ (N × N))
8	7	3ad2ant3 1136	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐶 ∈ (N × N))
9		elpqn 10920	. . . . . . 7 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N))
10	9	3ad2ant1 1134	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐴 ∈ (N × N))
11		addpipq2 10931	. . . . . 6 ⊢ ((𝐶 ∈ (N × N) ∧ 𝐴 ∈ (N × N)) → (𝐶 +pQ 𝐴) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐴))⟩)
12	8, 10, 11	syl2anc 585	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +pQ 𝐴) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐴)) +N ((1st ‘𝐴) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐴))⟩)
13		elpqn 10920	. . . . . . 7 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N))
14	13	3ad2ant2 1135	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐵 ∈ (N × N))
15		addpipq2 10931	. . . . . 6 ⊢ ((𝐶 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐶 +pQ 𝐵) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐵))⟩)
16	8, 14, 15	syl2anc 585	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +pQ 𝐵) = ⟨(((1st ‘𝐶) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐶))), ((2nd ‘𝐶) ·N (2nd ‘𝐵))⟩)
17	12, 16	breq12d 5162	. . . 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 10933	. . . . . . . 8 ⊢ ((𝐶 ∈ Q ∧ 𝐴 ∈ Q) → (𝐶 +Q 𝐴) = ([Q]‘(𝐶 +pQ 𝐴)))
19	18	ancoms 460	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐴) = ([Q]‘(𝐶 +pQ 𝐴)))
20	19	3adant2 1132	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐴) = ([Q]‘(𝐶 +pQ 𝐴)))
21		addpqnq 10933	. . . . . . . 8 ⊢ ((𝐶 ∈ Q ∧ 𝐵 ∈ Q) → (𝐶 +Q 𝐵) = ([Q]‘(𝐶 +pQ 𝐵)))
22	21	ancoms 460	. . . . . . 7 ⊢ ((𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐵) = ([Q]‘(𝐶 +pQ 𝐵)))
23	22	3adant1 1131	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐶 +Q 𝐵) = ([Q]‘(𝐶 +pQ 𝐵)))
24	20, 23	breq12d 5162	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵) ↔ ([Q]‘(𝐶 +pQ 𝐴)) <Q ([Q]‘(𝐶 +pQ 𝐵))))
25		lterpq 10965	. . . . 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 8008	. . . . . . . . . 10 ⊢ (𝐶 ∈ (N × N) → (2nd ‘𝐶) ∈ N)
28	8, 27	syl 17	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐶) ∈ N)
29		mulclpi 10888	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N)
30	28, 28, 29	syl2anc 585	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N)
31		ltmpi 10899	. . . . . . . 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 8008	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (N × N) → (2nd ‘𝐵) ∈ N)
34	14, 33	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐵) ∈ N)
35		mulclpi 10888	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ∈ N ∧ (2nd ‘𝐵) ∈ N) → ((2nd ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
36	28, 34, 35	syl2anc 585	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((2nd ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
37		xp1st 8007	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (N × N) → (1st ‘𝐶) ∈ N)
38	8, 37	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (1st ‘𝐶) ∈ N)
39		xp2nd 8008	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (N × N) → (2nd ‘𝐴) ∈ N)
40	10, 39	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐴) ∈ N)
41		mulclpi 10888	. . . . . . . . . 10 ⊢ (((1st ‘𝐶) ∈ N ∧ (2nd ‘𝐴) ∈ N) → ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N)
42	38, 40, 41	syl2anc 585	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N)
43		mulclpi 10888	. . . . . . . . 9 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐵)) ∈ N ∧ ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N) → (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N)
44	36, 42, 43	syl2anc 585	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N)
45		ltapi 10898	. . . . . . . 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 10891	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶)))
49		fvex 6905	. . . . . . . . . . 11 ⊢ (1st ‘𝐴) ∈ V
50		fvex 6905	. . . . . . . . . . 11 ⊢ (2nd ‘𝐵) ∈ V
51		fvex 6905	. . . . . . . . . . 11 ⊢ (2nd ‘𝐶) ∈ V
52		mulcompi 10891	. . . . . . . . . . 11 ⊢ (𝑥 ·N 𝑦) = (𝑦 ·N 𝑥)
53		mulasspi 10892	. . . . . . . . . . 11 ⊢ ((𝑥 ·N 𝑦) ·N 𝑧) = (𝑥 ·N (𝑦 ·N 𝑧))
54	49, 50, 51, 52, 53, 51	caov411 7639	. . . . . . . . . 10 ⊢ (((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶))) = (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐶)))
55	48, 54	eqtri 2761	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐶)))
56	55	oveq2i 7420	. . . . . . . 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 10893	. . . . . . . 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 10891	. . . . . . . 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 2767	. . . . . . 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 10891	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) = (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵)))
61		fvex 6905	. . . . . . . . . . 11 ⊢ (1st ‘𝐶) ∈ V
62		fvex 6905	. . . . . . . . . . 11 ⊢ (2nd ‘𝐴) ∈ V
63	61, 62, 51, 52, 53, 50	caov411 7639	. . . . . . . . . 10 ⊢ (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵)))
64	60, 63	eqtri 2761	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐵)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐴))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵)))
65		mulcompi 10891	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) = (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶)))
66		fvex 6905	. . . . . . . . . . 11 ⊢ (1st ‘𝐵) ∈ V
67	66, 62, 51, 52, 53, 51	caov411 7639	. . . . . . . . . 10 ⊢ (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))
68	65, 67	eqtri 2761	. . . . . . . . 9 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) = (((2nd ‘𝐶) ·N (2nd ‘𝐴)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))
69	64, 68	oveq12i 7421	. . . . . . . 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 10893	. . . . . . . 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 10891	. . . . . . . 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 2767	. . . . . . 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 5158	. . . . . 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 10937	. . . . 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 7597	1 ⊢ (𝐶 ∈ Q → (𝐴 <Q 𝐵 ↔ (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  ⟨cop 4635   class class class wbr 5149   × cxp 5675  ‘cfv 6544  (class class class)co 7409  1^st c1st 7973  2^nd c2nd 7974  Ncnpi 10839   +_N cpli 10840   ·_N cmi 10841   <_N clti 10842   +_pQ cplpq 10843   <_pQ cltpq 10845  Qcnq 10847  [Q]cerq 10849   +_Q cplq 10850   <_Q cltq 10853

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7856  df-1st 7975  df-2nd 7976  df-frecs 8266  df-wrecs 8297  df-recs 8371  df-rdg 8410  df-1o 8466  df-oadd 8470  df-omul 8471  df-er 8703  df-ni 10867  df-pli 10868  df-mi 10869  df-lti 10870  df-plpq 10903  df-ltpq 10905  df-enq 10906  df-nq 10907  df-erq 10908  df-plq 10909  df-1nq 10911  df-ltnq 10913

This theorem is referenced by:  ltaddnq  10969  ltbtwnnq  10973  addclpr  11013  distrlem4pr  11021  ltexprlem3  11033  ltexprlem4  11034  ltexprlem6  11036  prlem936  11042