Theorem orngmul 33298

Description: In an ordered ring, the ordering is compatible with the ring multiplication operation. (Contributed by Thierry Arnoux, 20-Jan-2018.)

Hypotheses

Ref	Expression
orngmul.0	⊢ 𝐵 = (Base‘𝑅)
orngmul.1	⊢ ≤ = (le‘𝑅)
orngmul.2	⊢ 0 = (0g‘𝑅)
orngmul.3	⊢ · = (.r‘𝑅)

Assertion

Ref	Expression
orngmul	⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → 0 ≤ (𝑋 · 𝑌))

Proof of Theorem orngmul

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp2r 1200	. 2 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → 0 ≤ 𝑋)
2		simp3r 1202	. 2 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → 0 ≤ 𝑌)
3		simp2l 1199	. . 3 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → 𝑋 ∈ 𝐵)
4		simp3l 1201	. . 3 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → 𝑌 ∈ 𝐵)
5		orngmul.0	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
6		orngmul.2	. . . . . 6 ⊢ 0 = (0g‘𝑅)
7		orngmul.3	. . . . . 6 ⊢ · = (.r‘𝑅)
8		orngmul.1	. . . . . 6 ⊢ ≤ = (le‘𝑅)
9	5, 6, 7, 8	isorng 33294	. . . . 5 ⊢ (𝑅 ∈ oRing ↔ (𝑅 ∈ Ring ∧ 𝑅 ∈ oGrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (( 0 ≤ 𝑎 ∧ 0 ≤ 𝑏) → 0 ≤ (𝑎 · 𝑏))))
10	9	simp3bi 1147	. . . 4 ⊢ (𝑅 ∈ oRing → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (( 0 ≤ 𝑎 ∧ 0 ≤ 𝑏) → 0 ≤ (𝑎 · 𝑏)))
11	10	3ad2ant1 1133	. . 3 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (( 0 ≤ 𝑎 ∧ 0 ≤ 𝑏) → 0 ≤ (𝑎 · 𝑏)))
12		breq2 5170	. . . . . 6 ⊢ (𝑎 = 𝑋 → ( 0 ≤ 𝑎 ↔ 0 ≤ 𝑋))
13	12	anbi1d 630	. . . . 5 ⊢ (𝑎 = 𝑋 → (( 0 ≤ 𝑎 ∧ 0 ≤ 𝑏) ↔ ( 0 ≤ 𝑋 ∧ 0 ≤ 𝑏)))
14		oveq1 7455	. . . . . 6 ⊢ (𝑎 = 𝑋 → (𝑎 · 𝑏) = (𝑋 · 𝑏))
15	14	breq2d 5178	. . . . 5 ⊢ (𝑎 = 𝑋 → ( 0 ≤ (𝑎 · 𝑏) ↔ 0 ≤ (𝑋 · 𝑏)))
16	13, 15	imbi12d 344	. . . 4 ⊢ (𝑎 = 𝑋 → ((( 0 ≤ 𝑎 ∧ 0 ≤ 𝑏) → 0 ≤ (𝑎 · 𝑏)) ↔ (( 0 ≤ 𝑋 ∧ 0 ≤ 𝑏) → 0 ≤ (𝑋 · 𝑏))))
17		breq2 5170	. . . . . 6 ⊢ (𝑏 = 𝑌 → ( 0 ≤ 𝑏 ↔ 0 ≤ 𝑌))
18	17	anbi2d 629	. . . . 5 ⊢ (𝑏 = 𝑌 → (( 0 ≤ 𝑋 ∧ 0 ≤ 𝑏) ↔ ( 0 ≤ 𝑋 ∧ 0 ≤ 𝑌)))
19		oveq2 7456	. . . . . 6 ⊢ (𝑏 = 𝑌 → (𝑋 · 𝑏) = (𝑋 · 𝑌))
20	19	breq2d 5178	. . . . 5 ⊢ (𝑏 = 𝑌 → ( 0 ≤ (𝑋 · 𝑏) ↔ 0 ≤ (𝑋 · 𝑌)))
21	18, 20	imbi12d 344	. . . 4 ⊢ (𝑏 = 𝑌 → ((( 0 ≤ 𝑋 ∧ 0 ≤ 𝑏) → 0 ≤ (𝑋 · 𝑏)) ↔ (( 0 ≤ 𝑋 ∧ 0 ≤ 𝑌) → 0 ≤ (𝑋 · 𝑌))))
22	16, 21	rspc2va 3647	. . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (( 0 ≤ 𝑎 ∧ 0 ≤ 𝑏) → 0 ≤ (𝑎 · 𝑏))) → (( 0 ≤ 𝑋 ∧ 0 ≤ 𝑌) → 0 ≤ (𝑋 · 𝑌)))
23	3, 4, 11, 22	syl21anc 837	. 2 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → (( 0 ≤ 𝑋 ∧ 0 ≤ 𝑌) → 0 ≤ (𝑋 · 𝑌)))
24	1, 2, 23	mp2and 698	1 ⊢ ((𝑅 ∈ oRing ∧ (𝑋 ∈ 𝐵 ∧ 0 ≤ 𝑋) ∧ (𝑌 ∈ 𝐵 ∧ 0 ≤ 𝑌)) → 0 ≤ (𝑋 · 𝑌))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ∀wral 3067   class class class wbr 5166  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  ._rcmulr 17312  lecple 17318  0_gc0g 17499  Ringcrg 20260  oGrpcogrp 33048  oRingcorng 33290

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-ext 2711  ax-nul 5324

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581  df-ov 7451  df-orng 33292

This theorem is referenced by:  orngsqr  33299  ornglmulle  33300  orngrmulle  33301  orngmullt  33304  suborng  33310