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

Theorem opprrngbg 14172
Description: A set is a non-unital ring if and only if its opposite is a non-unital ring. Bidirectional form of opprrng 14171. (Contributed by AV, 15-Feb-2025.)
Hypothesis
Ref Expression
opprbas.1 𝑂 = (oppr𝑅)
Assertion
Ref Expression
opprrngbg (𝑅𝑉 → (𝑅 ∈ Rng ↔ 𝑂 ∈ Rng))

Proof of Theorem opprrngbg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opprbas.1 . . 3 𝑂 = (oppr𝑅)
21opprrng 14171 . 2 (𝑅 ∈ Rng → 𝑂 ∈ Rng)
3 eqid 2231 . . . 4 (oppr𝑂) = (oppr𝑂)
43opprrng 14171 . . 3 (𝑂 ∈ Rng → (oppr𝑂) ∈ Rng)
5 eqid 2231 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
65a1i 9 . . . 4 (𝑅𝑉 → (Base‘𝑅) = (Base‘𝑅))
71, 5opprbasg 14169 . . . . 5 (𝑅𝑉 → (Base‘𝑅) = (Base‘𝑂))
81opprex 14167 . . . . . 6 (𝑅𝑉𝑂 ∈ V)
9 eqid 2231 . . . . . . 7 (Base‘𝑂) = (Base‘𝑂)
103, 9opprbasg 14169 . . . . . 6 (𝑂 ∈ V → (Base‘𝑂) = (Base‘(oppr𝑂)))
118, 10syl 14 . . . . 5 (𝑅𝑉 → (Base‘𝑂) = (Base‘(oppr𝑂)))
127, 11eqtrd 2264 . . . 4 (𝑅𝑉 → (Base‘𝑅) = (Base‘(oppr𝑂)))
13 eqid 2231 . . . . . . 7 (+g𝑅) = (+g𝑅)
141, 13oppraddg 14170 . . . . . 6 (𝑅𝑉 → (+g𝑅) = (+g𝑂))
15 eqid 2231 . . . . . . . 8 (+g𝑂) = (+g𝑂)
163, 15oppraddg 14170 . . . . . . 7 (𝑂 ∈ V → (+g𝑂) = (+g‘(oppr𝑂)))
178, 16syl 14 . . . . . 6 (𝑅𝑉 → (+g𝑂) = (+g‘(oppr𝑂)))
1814, 17eqtrd 2264 . . . . 5 (𝑅𝑉 → (+g𝑅) = (+g‘(oppr𝑂)))
1918oveqdr 6056 . . . 4 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑂))𝑦))
20 vex 2806 . . . . . . . 8 𝑥 ∈ V
2120a1i 9 . . . . . . 7 (𝑅𝑉𝑥 ∈ V)
22 vex 2806 . . . . . . . 8 𝑦 ∈ V
2322a1i 9 . . . . . . 7 (𝑅𝑉𝑦 ∈ V)
24 eqid 2231 . . . . . . . 8 (.r𝑂) = (.r𝑂)
25 eqid 2231 . . . . . . . 8 (.r‘(oppr𝑂)) = (.r‘(oppr𝑂))
269, 24, 3, 25opprmulg 14165 . . . . . . 7 ((𝑂 ∈ V ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥(.r‘(oppr𝑂))𝑦) = (𝑦(.r𝑂)𝑥))
278, 21, 23, 26syl3anc 1274 . . . . . 6 (𝑅𝑉 → (𝑥(.r‘(oppr𝑂))𝑦) = (𝑦(.r𝑂)𝑥))
2827adantr 276 . . . . 5 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(.r‘(oppr𝑂))𝑦) = (𝑦(.r𝑂)𝑥))
29 simpl 109 . . . . . 6 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑅𝑉)
30 simprr 533 . . . . . 6 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑦 ∈ (Base‘𝑅))
31 simprl 531 . . . . . 6 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑥 ∈ (Base‘𝑅))
32 eqid 2231 . . . . . . 7 (.r𝑅) = (.r𝑅)
335, 32, 1, 24opprmulg 14165 . . . . . 6 ((𝑅𝑉𝑦 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑦(.r𝑂)𝑥) = (𝑥(.r𝑅)𝑦))
3429, 30, 31, 33syl3anc 1274 . . . . 5 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑦(.r𝑂)𝑥) = (𝑥(.r𝑅)𝑦))
3528, 34eqtr2d 2265 . . . 4 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(.r𝑅)𝑦) = (𝑥(.r‘(oppr𝑂))𝑦))
366, 12, 19, 35rngpropd 14049 . . 3 (𝑅𝑉 → (𝑅 ∈ Rng ↔ (oppr𝑂) ∈ Rng))
374, 36imbitrrid 156 . 2 (𝑅𝑉 → (𝑂 ∈ Rng → 𝑅 ∈ Rng))
382, 37impbid2 143 1 (𝑅𝑉 → (𝑅 ∈ Rng ↔ 𝑂 ∈ Rng))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2202  Vcvv 2803  cfv 5333  (class class class)co 6028  Basecbs 13162  +gcplusg 13240  .rcmulr 13241  Rngcrng 14026  opprcoppr 14161
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-pre-ltirr 8204  ax-pre-lttrn 8206  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-tpos 6454  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-inn 9203  df-2 9261  df-3 9262  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-plusg 13253  df-mulr 13254  df-0g 13421  df-mgm 13519  df-sgrp 13565  df-mnd 13580  df-grp 13666  df-cmn 13953  df-abl 13954  df-mgp 14015  df-rng 14027  df-oppr 14162
This theorem is referenced by:  opprsubrngg  14306
  Copyright terms: Public domain W3C validator