| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > orngmullt | Structured version Visualization version GIF version | ||
| Description: In an ordered ring, the strict ordering is compatible with the ring multiplication operation. (Contributed by Thierry Arnoux, 9-Sep-2018.) |
| Ref | Expression |
|---|---|
| orngmullt.b | ⊢ 𝐵 = (Base‘𝑅) |
| orngmullt.t | ⊢ · = (.r‘𝑅) |
| orngmullt.0 | ⊢ 0 = (0g‘𝑅) |
| orngmullt.l | ⊢ < = (lt‘𝑅) |
| orngmullt.1 | ⊢ (𝜑 → 𝑅 ∈ oRing) |
| orngmullt.4 | ⊢ (𝜑 → 𝑅 ∈ DivRing) |
| orngmullt.2 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| orngmullt.3 | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| orngmullt.x | ⊢ (𝜑 → 0 < 𝑋) |
| orngmullt.y | ⊢ (𝜑 → 0 < 𝑌) |
| Ref | Expression |
|---|---|
| orngmullt | ⊢ (𝜑 → 0 < (𝑋 · 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orngmullt.1 | . . 3 ⊢ (𝜑 → 𝑅 ∈ oRing) | |
| 2 | orngmullt.2 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 3 | orngmullt.x | . . . . 5 ⊢ (𝜑 → 0 < 𝑋) | |
| 4 | orngring 20841 | . . . . . . 7 ⊢ (𝑅 ∈ oRing → 𝑅 ∈ Ring) | |
| 5 | ringgrp 20217 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 6 | orngmullt.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅) | |
| 7 | orngmullt.0 | . . . . . . . 8 ⊢ 0 = (0g‘𝑅) | |
| 8 | 6, 7 | grpidcl 18939 | . . . . . . 7 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐵) |
| 9 | 1, 4, 5, 8 | 4syl 19 | . . . . . 6 ⊢ (𝜑 → 0 ∈ 𝐵) |
| 10 | eqid 2740 | . . . . . . 7 ⊢ (le‘𝑅) = (le‘𝑅) | |
| 11 | orngmullt.l | . . . . . . 7 ⊢ < = (lt‘𝑅) | |
| 12 | 10, 11 | pltval 18294 | . . . . . 6 ⊢ ((𝑅 ∈ oRing ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ( 0 < 𝑋 ↔ ( 0 (le‘𝑅)𝑋 ∧ 0 ≠ 𝑋))) |
| 13 | 1, 9, 2, 12 | syl3anc 1379 | . . . . 5 ⊢ (𝜑 → ( 0 < 𝑋 ↔ ( 0 (le‘𝑅)𝑋 ∧ 0 ≠ 𝑋))) |
| 14 | 3, 13 | mpbid 233 | . . . 4 ⊢ (𝜑 → ( 0 (le‘𝑅)𝑋 ∧ 0 ≠ 𝑋)) |
| 15 | 14 | simpld 495 | . . 3 ⊢ (𝜑 → 0 (le‘𝑅)𝑋) |
| 16 | orngmullt.3 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 17 | orngmullt.y | . . . . 5 ⊢ (𝜑 → 0 < 𝑌) | |
| 18 | 10, 11 | pltval 18294 | . . . . . 6 ⊢ ((𝑅 ∈ oRing ∧ 0 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 < 𝑌 ↔ ( 0 (le‘𝑅)𝑌 ∧ 0 ≠ 𝑌))) |
| 19 | 1, 9, 16, 18 | syl3anc 1379 | . . . . 5 ⊢ (𝜑 → ( 0 < 𝑌 ↔ ( 0 (le‘𝑅)𝑌 ∧ 0 ≠ 𝑌))) |
| 20 | 17, 19 | mpbid 233 | . . . 4 ⊢ (𝜑 → ( 0 (le‘𝑅)𝑌 ∧ 0 ≠ 𝑌)) |
| 21 | 20 | simpld 495 | . . 3 ⊢ (𝜑 → 0 (le‘𝑅)𝑌) |
| 22 | orngmullt.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 23 | 6, 10, 7, 22 | orngmul 20844 | . . 3 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 (le‘𝑅)𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 (le‘𝑅)𝑌)) → 0 (le‘𝑅)(𝑋 · 𝑌)) |
| 24 | 1, 2, 15, 16, 21, 23 | syl122anc 1387 | . 2 ⊢ (𝜑 → 0 (le‘𝑅)(𝑋 · 𝑌)) |
| 25 | 14 | simprd 496 | . . . . 5 ⊢ (𝜑 → 0 ≠ 𝑋) |
| 26 | 25 | necomd 2990 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0 ) |
| 27 | 20 | simprd 496 | . . . . 5 ⊢ (𝜑 → 0 ≠ 𝑌) |
| 28 | 27 | necomd 2990 | . . . 4 ⊢ (𝜑 → 𝑌 ≠ 0 ) |
| 29 | orngmullt.4 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ DivRing) | |
| 30 | 6, 7, 22, 29, 2, 16 | drngmulne0 20741 | . . . 4 ⊢ (𝜑 → ((𝑋 · 𝑌) ≠ 0 ↔ (𝑋 ≠ 0 ∧ 𝑌 ≠ 0 ))) |
| 31 | 26, 28, 30 | mpbir2and 719 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑌) ≠ 0 ) |
| 32 | 31 | necomd 2990 | . 2 ⊢ (𝜑 → 0 ≠ (𝑋 · 𝑌)) |
| 33 | 1, 4 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring) |
| 34 | 6, 22 | ringcl 20229 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| 35 | 33, 2, 16, 34 | syl3anc 1379 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝐵) |
| 36 | 10, 11 | pltval 18294 | . . 3 ⊢ ((𝑅 ∈ oRing ∧ 0 ∈ 𝐵 ∧ (𝑋 · 𝑌) ∈ 𝐵) → ( 0 < (𝑋 · 𝑌) ↔ ( 0 (le‘𝑅)(𝑋 · 𝑌) ∧ 0 ≠ (𝑋 · 𝑌)))) |
| 37 | 1, 9, 35, 36 | syl3anc 1379 | . 2 ⊢ (𝜑 → ( 0 < (𝑋 · 𝑌) ↔ ( 0 (le‘𝑅)(𝑋 · 𝑌) ∧ 0 ≠ (𝑋 · 𝑌)))) |
| 38 | 24, 32, 37 | mpbir2and 719 | 1 ⊢ (𝜑 → 0 < (𝑋 · 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 class class class wbr 5079 ‘cfv 6492 (class class class)co 7363 Basecbs 17177 .rcmulr 17219 lecple 17225 0gc0g 17400 ltcplt 18272 Grpcgrp 18907 Ringcrg 20212 DivRingcdr 20708 oRingcorng 20836 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-2nd 7939 df-tpos 8173 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-3 12243 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-mulr 17232 df-0g 17402 df-plt 18292 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-grp 18910 df-minusg 18911 df-cmn 19755 df-abl 19756 df-mgp 20120 df-rng 20132 df-ur 20161 df-ring 20214 df-oppr 20315 df-dvdsr 20335 df-unit 20336 df-invr 20366 df-nzr 20492 df-rlreg 20673 df-domn 20674 df-drng 20710 df-orng 20838 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |