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

Theorem ltmprr 7180
Description: Ordering property of multiplication. (Contributed by Jim Kingdon, 18-Feb-2020.)
Assertion
Ref Expression
ltmprr ((𝐴P𝐵P𝐶P) → ((𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵) → 𝐴<P 𝐵))

Proof of Theorem ltmprr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 recexpr 7176 . . . . 5 (𝐶P → ∃𝑦P (𝐶 ·P 𝑦) = 1P)
213ad2ant3 966 . . . 4 ((𝐴P𝐵P𝐶P) → ∃𝑦P (𝐶 ·P 𝑦) = 1P)
32adantr 270 . . 3 (((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) → ∃𝑦P (𝐶 ·P 𝑦) = 1P)
4 ltexpri 7151 . . . . 5 ((𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵) → ∃𝑥P ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))
54ad2antlr 473 . . . 4 ((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) → ∃𝑥P ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))
6 simplll 500 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝐴P𝐵P𝐶P))
76simp1d 955 . . . . . 6 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → 𝐴P)
8 simplrl 502 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → 𝑦P)
9 simprl 498 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → 𝑥P)
10 mulclpr 7110 . . . . . . 7 ((𝑦P𝑥P) → (𝑦 ·P 𝑥) ∈ P)
118, 9, 10syl2anc 403 . . . . . 6 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝑦 ·P 𝑥) ∈ P)
12 ltaddpr 7135 . . . . . 6 ((𝐴P ∧ (𝑦 ·P 𝑥) ∈ P) → 𝐴<P (𝐴 +P (𝑦 ·P 𝑥)))
137, 11, 12syl2anc 403 . . . . 5 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → 𝐴<P (𝐴 +P (𝑦 ·P 𝑥)))
14 simprr 499 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))
1514oveq2d 5650 . . . . . 6 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝑦 ·P ((𝐶 ·P 𝐴) +P 𝑥)) = (𝑦 ·P (𝐶 ·P 𝐵)))
166simp3d 957 . . . . . . . . 9 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → 𝐶P)
17 mulclpr 7110 . . . . . . . . 9 ((𝐶P𝐴P) → (𝐶 ·P 𝐴) ∈ P)
1816, 7, 17syl2anc 403 . . . . . . . 8 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝐶 ·P 𝐴) ∈ P)
19 distrprg 7126 . . . . . . . 8 ((𝑦P ∧ (𝐶 ·P 𝐴) ∈ P𝑥P) → (𝑦 ·P ((𝐶 ·P 𝐴) +P 𝑥)) = ((𝑦 ·P (𝐶 ·P 𝐴)) +P (𝑦 ·P 𝑥)))
208, 18, 9, 19syl3anc 1174 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝑦 ·P ((𝐶 ·P 𝐴) +P 𝑥)) = ((𝑦 ·P (𝐶 ·P 𝐴)) +P (𝑦 ·P 𝑥)))
21 mulassprg 7119 . . . . . . . . 9 ((𝑦P𝐶P𝐴P) → ((𝑦 ·P 𝐶) ·P 𝐴) = (𝑦 ·P (𝐶 ·P 𝐴)))
228, 16, 7, 21syl3anc 1174 . . . . . . . 8 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → ((𝑦 ·P 𝐶) ·P 𝐴) = (𝑦 ·P (𝐶 ·P 𝐴)))
2322oveq1d 5649 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (((𝑦 ·P 𝐶) ·P 𝐴) +P (𝑦 ·P 𝑥)) = ((𝑦 ·P (𝐶 ·P 𝐴)) +P (𝑦 ·P 𝑥)))
24 mulcomprg 7118 . . . . . . . . . . . 12 ((𝑦P𝐶P) → (𝑦 ·P 𝐶) = (𝐶 ·P 𝑦))
258, 16, 24syl2anc 403 . . . . . . . . . . 11 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝑦 ·P 𝐶) = (𝐶 ·P 𝑦))
26 simplrr 503 . . . . . . . . . . 11 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝐶 ·P 𝑦) = 1P)
2725, 26eqtrd 2120 . . . . . . . . . 10 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝑦 ·P 𝐶) = 1P)
2827oveq1d 5649 . . . . . . . . 9 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → ((𝑦 ·P 𝐶) ·P 𝐴) = (1P ·P 𝐴))
29 1pr 7092 . . . . . . . . . . . 12 1PP
30 mulcomprg 7118 . . . . . . . . . . . 12 ((𝐴P ∧ 1PP) → (𝐴 ·P 1P) = (1P ·P 𝐴))
3129, 30mpan2 416 . . . . . . . . . . 11 (𝐴P → (𝐴 ·P 1P) = (1P ·P 𝐴))
32 1idpr 7130 . . . . . . . . . . 11 (𝐴P → (𝐴 ·P 1P) = 𝐴)
3331, 32eqtr3d 2122 . . . . . . . . . 10 (𝐴P → (1P ·P 𝐴) = 𝐴)
347, 33syl 14 . . . . . . . . 9 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (1P ·P 𝐴) = 𝐴)
3528, 34eqtrd 2120 . . . . . . . 8 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → ((𝑦 ·P 𝐶) ·P 𝐴) = 𝐴)
3635oveq1d 5649 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (((𝑦 ·P 𝐶) ·P 𝐴) +P (𝑦 ·P 𝑥)) = (𝐴 +P (𝑦 ·P 𝑥)))
3720, 23, 363eqtr2d 2126 . . . . . 6 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝑦 ·P ((𝐶 ·P 𝐴) +P 𝑥)) = (𝐴 +P (𝑦 ·P 𝑥)))
3827oveq1d 5649 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → ((𝑦 ·P 𝐶) ·P 𝐵) = (1P ·P 𝐵))
396simp2d 956 . . . . . . . 8 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → 𝐵P)
40 mulassprg 7119 . . . . . . . 8 ((𝑦P𝐶P𝐵P) → ((𝑦 ·P 𝐶) ·P 𝐵) = (𝑦 ·P (𝐶 ·P 𝐵)))
418, 16, 39, 40syl3anc 1174 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → ((𝑦 ·P 𝐶) ·P 𝐵) = (𝑦 ·P (𝐶 ·P 𝐵)))
42 mulcomprg 7118 . . . . . . . . . 10 ((𝐵P ∧ 1PP) → (𝐵 ·P 1P) = (1P ·P 𝐵))
4329, 42mpan2 416 . . . . . . . . 9 (𝐵P → (𝐵 ·P 1P) = (1P ·P 𝐵))
44 1idpr 7130 . . . . . . . . 9 (𝐵P → (𝐵 ·P 1P) = 𝐵)
4543, 44eqtr3d 2122 . . . . . . . 8 (𝐵P → (1P ·P 𝐵) = 𝐵)
4639, 45syl 14 . . . . . . 7 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (1P ·P 𝐵) = 𝐵)
4738, 41, 463eqtr3d 2128 . . . . . 6 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝑦 ·P (𝐶 ·P 𝐵)) = 𝐵)
4815, 37, 473eqtr3d 2128 . . . . 5 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → (𝐴 +P (𝑦 ·P 𝑥)) = 𝐵)
4913, 48breqtrd 3861 . . . 4 (((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) ∧ (𝑥P ∧ ((𝐶 ·P 𝐴) +P 𝑥) = (𝐶 ·P 𝐵))) → 𝐴<P 𝐵)
505, 49rexlimddv 2493 . . 3 ((((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) ∧ (𝑦P ∧ (𝐶 ·P 𝑦) = 1P)) → 𝐴<P 𝐵)
513, 50rexlimddv 2493 . 2 (((𝐴P𝐵P𝐶P) ∧ (𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵)) → 𝐴<P 𝐵)
5251ex 113 1 ((𝐴P𝐵P𝐶P) → ((𝐶 ·P 𝐴)<P (𝐶 ·P 𝐵) → 𝐴<P 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  w3a 924   = wceq 1289  wcel 1438  wrex 2360   class class class wbr 3837  (class class class)co 5634  Pcnp 6829  1Pc1p 6830   +P cpp 6831   ·P cmp 6832  <P cltp 6833
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3946  ax-sep 3949  ax-nul 3957  ax-pow 4001  ax-pr 4027  ax-un 4251  ax-setind 4343  ax-iinf 4393
This theorem depends on definitions:  df-bi 115  df-dc 781  df-3or 925  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2839  df-csb 2932  df-dif 2999  df-un 3001  df-in 3003  df-ss 3010  df-nul 3285  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450  df-uni 3649  df-int 3684  df-iun 3727  df-br 3838  df-opab 3892  df-mpt 3893  df-tr 3929  df-eprel 4107  df-id 4111  df-po 4114  df-iso 4115  df-iord 4184  df-on 4186  df-suc 4189  df-iom 4396  df-xp 4434  df-rel 4435  df-cnv 4436  df-co 4437  df-dm 4438  df-rn 4439  df-res 4440  df-ima 4441  df-iota 4967  df-fun 5004  df-fn 5005  df-f 5006  df-f1 5007  df-fo 5008  df-f1o 5009  df-fv 5010  df-ov 5637  df-oprab 5638  df-mpt2 5639  df-1st 5893  df-2nd 5894  df-recs 6052  df-irdg 6117  df-1o 6163  df-2o 6164  df-oadd 6167  df-omul 6168  df-er 6272  df-ec 6274  df-qs 6278  df-ni 6842  df-pli 6843  df-mi 6844  df-lti 6845  df-plpq 6882  df-mpq 6883  df-enq 6885  df-nqqs 6886  df-plqqs 6887  df-mqqs 6888  df-1nqqs 6889  df-rq 6890  df-ltnqqs 6891  df-enq0 6962  df-nq0 6963  df-0nq0 6964  df-plq0 6965  df-mq0 6966  df-inp 7004  df-i1p 7005  df-iplp 7006  df-imp 7007  df-iltp 7008
This theorem is referenced by:  mulextsr1lem  7304
  Copyright terms: Public domain W3C validator