Theorem ltmnqg 7057

Description: Ordering property of multiplication for positive fractions. Proposition 9-2.6(iii) of [Gleason] p. 120. (Contributed by Jim Kingdon, 22-Sep-2019.)

Assertion

Ref	Expression
ltmnqg	⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 <Q 𝐵 ↔ (𝐶 ·Q 𝐴) <Q (𝐶 ·Q 𝐵)))

Proof of Theorem ltmnqg

Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nqqs 7004	. 2 ⊢ Q = ((N × N) / ~Q )
2		breq1 3870	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → ([⟨𝑥, 𝑦⟩] ~Q <Q [⟨𝑧, 𝑤⟩] ~Q ↔ 𝐴 <Q [⟨𝑧, 𝑤⟩] ~Q ))
3		oveq2 5698	. . . 4 ⊢ ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) = ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴))
4	3	breq1d 3877	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → (([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ) ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q )))
5	2, 4	bibi12d 234	. 2 ⊢ ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → (([⟨𝑥, 𝑦⟩] ~Q <Q [⟨𝑧, 𝑤⟩] ~Q ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q )) ↔ (𝐴 <Q [⟨𝑧, 𝑤⟩] ~Q ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ))))
6		breq2 3871	. . 3 ⊢ ([⟨𝑧, 𝑤⟩] ~Q = 𝐵 → (𝐴 <Q [⟨𝑧, 𝑤⟩] ~Q ↔ 𝐴 <Q 𝐵))
7		oveq2 5698	. . . 4 ⊢ ([⟨𝑧, 𝑤⟩] ~Q = 𝐵 → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ) = ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐵))
8	7	breq2d 3879	. . 3 ⊢ ([⟨𝑧, 𝑤⟩] ~Q = 𝐵 → (([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ) ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐵)))
9	6, 8	bibi12d 234	. 2 ⊢ ([⟨𝑧, 𝑤⟩] ~Q = 𝐵 → ((𝐴 <Q [⟨𝑧, 𝑤⟩] ~Q ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q )) ↔ (𝐴 <Q 𝐵 ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐵))))
10		oveq1 5697	. . . 4 ⊢ ([⟨𝑣, 𝑢⟩] ~Q = 𝐶 → ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) = (𝐶 ·Q 𝐴))
11		oveq1 5697	. . . 4 ⊢ ([⟨𝑣, 𝑢⟩] ~Q = 𝐶 → ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐵) = (𝐶 ·Q 𝐵))
12	10, 11	breq12d 3880	. . 3 ⊢ ([⟨𝑣, 𝑢⟩] ~Q = 𝐶 → (([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐵) ↔ (𝐶 ·Q 𝐴) <Q (𝐶 ·Q 𝐵)))
13	12	bibi2d 231	. 2 ⊢ ([⟨𝑣, 𝑢⟩] ~Q = 𝐶 → ((𝐴 <Q 𝐵 ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐴) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q 𝐵)) ↔ (𝐴 <Q 𝐵 ↔ (𝐶 ·Q 𝐴) <Q (𝐶 ·Q 𝐵))))
14		mulclpi 6984	. . . . . . . 8 ⊢ ((𝑓 ∈ N ∧ 𝑔 ∈ N) → (𝑓 ·N 𝑔) ∈ N)
15	14	adantl 272	. . . . . . 7 ⊢ ((((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) ∧ (𝑓 ∈ N ∧ 𝑔 ∈ N)) → (𝑓 ·N 𝑔) ∈ N)
16		simp1l 970	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → 𝑥 ∈ N)
17		simp2r 973	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → 𝑤 ∈ N)
18	15, 16, 17	caovcld 5836	. . . . . 6 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (𝑥 ·N 𝑤) ∈ N)
19		simp1r 971	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → 𝑦 ∈ N)
20		simp2l 972	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → 𝑧 ∈ N)
21	15, 19, 20	caovcld 5836	. . . . . 6 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (𝑦 ·N 𝑧) ∈ N)
22		mulclpi 6984	. . . . . . 7 ⊢ ((𝑣 ∈ N ∧ 𝑢 ∈ N) → (𝑣 ·N 𝑢) ∈ N)
23	22	3ad2ant3 969	. . . . . 6 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (𝑣 ·N 𝑢) ∈ N)
24		ltmpig 6995	. . . . . 6 ⊢ (((𝑥 ·N 𝑤) ∈ N ∧ (𝑦 ·N 𝑧) ∈ N ∧ (𝑣 ·N 𝑢) ∈ N) → ((𝑥 ·N 𝑤) <N (𝑦 ·N 𝑧) ↔ ((𝑣 ·N 𝑢) ·N (𝑥 ·N 𝑤)) <N ((𝑣 ·N 𝑢) ·N (𝑦 ·N 𝑧))))
25	18, 21, 23, 24	syl3anc 1181	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ((𝑥 ·N 𝑤) <N (𝑦 ·N 𝑧) ↔ ((𝑣 ·N 𝑢) ·N (𝑥 ·N 𝑤)) <N ((𝑣 ·N 𝑢) ·N (𝑦 ·N 𝑧))))
26		simp3l 974	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → 𝑣 ∈ N)
27		simp3r 975	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → 𝑢 ∈ N)
28		mulcompig 6987	. . . . . . . 8 ⊢ ((𝑓 ∈ N ∧ 𝑔 ∈ N) → (𝑓 ·N 𝑔) = (𝑔 ·N 𝑓))
29	28	adantl 272	. . . . . . 7 ⊢ ((((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) ∧ (𝑓 ∈ N ∧ 𝑔 ∈ N)) → (𝑓 ·N 𝑔) = (𝑔 ·N 𝑓))
30		mulasspig 6988	. . . . . . . 8 ⊢ ((𝑓 ∈ N ∧ 𝑔 ∈ N ∧ ℎ ∈ N) → ((𝑓 ·N 𝑔) ·N ℎ) = (𝑓 ·N (𝑔 ·N ℎ)))
31	30	adantl 272	. . . . . . 7 ⊢ ((((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) ∧ (𝑓 ∈ N ∧ 𝑔 ∈ N ∧ ℎ ∈ N)) → ((𝑓 ·N 𝑔) ·N ℎ) = (𝑓 ·N (𝑔 ·N ℎ)))
32	26, 16, 27, 29, 31, 17, 15	caov4d 5867	. . . . . 6 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ((𝑣 ·N 𝑥) ·N (𝑢 ·N 𝑤)) = ((𝑣 ·N 𝑢) ·N (𝑥 ·N 𝑤)))
33	27, 19, 26, 29, 31, 20, 15	caov4d 5867	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ((𝑢 ·N 𝑦) ·N (𝑣 ·N 𝑧)) = ((𝑢 ·N 𝑣) ·N (𝑦 ·N 𝑧)))
34		mulcompig 6987	. . . . . . . . . 10 ⊢ ((𝑢 ∈ N ∧ 𝑣 ∈ N) → (𝑢 ·N 𝑣) = (𝑣 ·N 𝑢))
35	34	oveq1d 5705	. . . . . . . . 9 ⊢ ((𝑢 ∈ N ∧ 𝑣 ∈ N) → ((𝑢 ·N 𝑣) ·N (𝑦 ·N 𝑧)) = ((𝑣 ·N 𝑢) ·N (𝑦 ·N 𝑧)))
36	35	ancoms 265	. . . . . . . 8 ⊢ ((𝑣 ∈ N ∧ 𝑢 ∈ N) → ((𝑢 ·N 𝑣) ·N (𝑦 ·N 𝑧)) = ((𝑣 ·N 𝑢) ·N (𝑦 ·N 𝑧)))
37	36	3ad2ant3 969	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ((𝑢 ·N 𝑣) ·N (𝑦 ·N 𝑧)) = ((𝑣 ·N 𝑢) ·N (𝑦 ·N 𝑧)))
38	33, 37	eqtrd 2127	. . . . . 6 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ((𝑢 ·N 𝑦) ·N (𝑣 ·N 𝑧)) = ((𝑣 ·N 𝑢) ·N (𝑦 ·N 𝑧)))
39	32, 38	breq12d 3880	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (((𝑣 ·N 𝑥) ·N (𝑢 ·N 𝑤)) <N ((𝑢 ·N 𝑦) ·N (𝑣 ·N 𝑧)) ↔ ((𝑣 ·N 𝑢) ·N (𝑥 ·N 𝑤)) <N ((𝑣 ·N 𝑢) ·N (𝑦 ·N 𝑧))))
40	25, 39	bitr4d 190	. . . 4 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ((𝑥 ·N 𝑤) <N (𝑦 ·N 𝑧) ↔ ((𝑣 ·N 𝑥) ·N (𝑢 ·N 𝑤)) <N ((𝑢 ·N 𝑦) ·N (𝑣 ·N 𝑧))))
41		ordpipqqs 7030	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N)) → ([⟨𝑥, 𝑦⟩] ~Q <Q [⟨𝑧, 𝑤⟩] ~Q ↔ (𝑥 ·N 𝑤) <N (𝑦 ·N 𝑧)))
42	41	3adant3 966	. . . 4 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨𝑥, 𝑦⟩] ~Q <Q [⟨𝑧, 𝑤⟩] ~Q ↔ (𝑥 ·N 𝑤) <N (𝑦 ·N 𝑧)))
43	15, 26, 16	caovcld 5836	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (𝑣 ·N 𝑥) ∈ N)
44	15, 27, 19	caovcld 5836	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (𝑢 ·N 𝑦) ∈ N)
45	15, 26, 20	caovcld 5836	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (𝑣 ·N 𝑧) ∈ N)
46	15, 27, 17	caovcld 5836	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (𝑢 ·N 𝑤) ∈ N)
47		ordpipqqs 7030	. . . . 5 ⊢ ((((𝑣 ·N 𝑥) ∈ N ∧ (𝑢 ·N 𝑦) ∈ N) ∧ ((𝑣 ·N 𝑧) ∈ N ∧ (𝑢 ·N 𝑤) ∈ N)) → ([⟨(𝑣 ·N 𝑥), (𝑢 ·N 𝑦)⟩] ~Q <Q [⟨(𝑣 ·N 𝑧), (𝑢 ·N 𝑤)⟩] ~Q ↔ ((𝑣 ·N 𝑥) ·N (𝑢 ·N 𝑤)) <N ((𝑢 ·N 𝑦) ·N (𝑣 ·N 𝑧))))
48	43, 44, 45, 46, 47	syl22anc 1182	. . . 4 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨(𝑣 ·N 𝑥), (𝑢 ·N 𝑦)⟩] ~Q <Q [⟨(𝑣 ·N 𝑧), (𝑢 ·N 𝑤)⟩] ~Q ↔ ((𝑣 ·N 𝑥) ·N (𝑢 ·N 𝑤)) <N ((𝑢 ·N 𝑦) ·N (𝑣 ·N 𝑧))))
49	40, 42, 48	3bitr4d 219	. . 3 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨𝑥, 𝑦⟩] ~Q <Q [⟨𝑧, 𝑤⟩] ~Q ↔ [⟨(𝑣 ·N 𝑥), (𝑢 ·N 𝑦)⟩] ~Q <Q [⟨(𝑣 ·N 𝑧), (𝑢 ·N 𝑤)⟩] ~Q ))
50		mulpipqqs 7029	. . . . . 6 ⊢ (((𝑣 ∈ N ∧ 𝑢 ∈ N) ∧ (𝑥 ∈ N ∧ 𝑦 ∈ N)) → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) = [⟨(𝑣 ·N 𝑥), (𝑢 ·N 𝑦)⟩] ~Q )
51	50	ancoms 265	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) = [⟨(𝑣 ·N 𝑥), (𝑢 ·N 𝑦)⟩] ~Q )
52	51	3adant2 965	. . . 4 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) = [⟨(𝑣 ·N 𝑥), (𝑢 ·N 𝑦)⟩] ~Q )
53		mulpipqqs 7029	. . . . . 6 ⊢ (((𝑣 ∈ N ∧ 𝑢 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N)) → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ) = [⟨(𝑣 ·N 𝑧), (𝑢 ·N 𝑤)⟩] ~Q )
54	53	ancoms 265	. . . . 5 ⊢ (((𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ) = [⟨(𝑣 ·N 𝑧), (𝑢 ·N 𝑤)⟩] ~Q )
55	54	3adant1 964	. . . 4 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ) = [⟨(𝑣 ·N 𝑧), (𝑢 ·N 𝑤)⟩] ~Q )
56	52, 55	breq12d 3880	. . 3 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → (([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q ) ↔ [⟨(𝑣 ·N 𝑥), (𝑢 ·N 𝑦)⟩] ~Q <Q [⟨(𝑣 ·N 𝑧), (𝑢 ·N 𝑤)⟩] ~Q ))
57	49, 56	bitr4d 190	. 2 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑣 ∈ N ∧ 𝑢 ∈ N)) → ([⟨𝑥, 𝑦⟩] ~Q <Q [⟨𝑧, 𝑤⟩] ~Q ↔ ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑥, 𝑦⟩] ~Q ) <Q ([⟨𝑣, 𝑢⟩] ~Q ·Q [⟨𝑧, 𝑤⟩] ~Q )))
58	1, 5, 9, 13, 57	3ecoptocl 6421	1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 <Q 𝐵 ↔ (𝐶 ·Q 𝐴) <Q (𝐶 ·Q 𝐵)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 927   = wceq 1296   ∈ wcel 1445  ⟨cop 3469   class class class wbr 3867  (class class class)co 5690  [cec 6330  Ncnpi 6928   ·_N cmi 6930   <_N clti 6931   ~_Q ceq 6935  Qcnq 6936   ·_Q cmq 6939   <_Q cltq 6941

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 582  ax-in2 583  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-13 1456  ax-14 1457  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077  ax-coll 3975  ax-sep 3978  ax-nul 3986  ax-pow 4030  ax-pr 4060  ax-un 4284  ax-setind 4381  ax-iinf 4431

This theorem depends on definitions:  df-bi 116  df-dc 784  df-3or 928  df-3an 929  df-tru 1299  df-fal 1302  df-nf 1402  df-sb 1700  df-eu 1958  df-mo 1959  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-ne 2263  df-ral 2375  df-rex 2376  df-reu 2377  df-rab 2379  df-v 2635  df-sbc 2855  df-csb 2948  df-dif 3015  df-un 3017  df-in 3019  df-ss 3026  df-nul 3303  df-pw 3451  df-sn 3472  df-pr 3473  df-op 3475  df-uni 3676  df-int 3711  df-iun 3754  df-br 3868  df-opab 3922  df-mpt 3923  df-tr 3959  df-eprel 4140  df-id 4144  df-iord 4217  df-on 4219  df-suc 4222  df-iom 4434  df-xp 4473  df-rel 4474  df-cnv 4475  df-co 4476  df-dm 4477  df-rn 4478  df-res 4479  df-ima 4480  df-iota 5014  df-fun 5051  df-fn 5052  df-f 5053  df-f1 5054  df-fo 5055  df-f1o 5056  df-fv 5057  df-ov 5693  df-oprab 5694  df-mpt2 5695  df-1st 5949  df-2nd 5950  df-recs 6108  df-irdg 6173  df-oadd 6223  df-omul 6224  df-er 6332  df-ec 6334  df-qs 6338  df-ni 6960  df-mi 6962  df-lti 6963  df-mpq 7001  df-enq 7003  df-nqqs 7004  df-mqqs 7006  df-ltnqqs 7009

This theorem is referenced by:  ltmnqi  7059  lt2mulnq  7061  ltaddnq  7063  prarloclemarch  7074  prarloclemarch2  7075  ltrnqg  7076  prarloclemlt  7149  addnqprllem  7183  addnqprulem  7184  appdivnq  7219  mulnqprl  7224  mulnqpru  7225  mullocprlem  7226  mulclpr  7228  distrlem4prl  7240  distrlem4pru  7241  1idprl  7246  1idpru  7247  recexprlem1ssl  7289  recexprlem1ssu  7290