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

Theorem opprrngbg 14467
Description: A set is a non-unital ring if and only if its opposite is a non-unital ring. Bidirectional form of opprrng 14466. (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 14466 . 2 (𝑅 ∈ Rng → 𝑂 ∈ Rng)
3 eqid 2238 . . . 4 (oppr‘𝑂) = (oppr‘𝑂)
43opprrng 14466 . . 3 (𝑂 ∈ Rng → (oppr‘𝑂) ∈ Rng)
5 eqid 2238 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
65a1i 9 . . . 4 (𝑅 ∈ 𝑉 → (Base‘𝑅) = (Base‘𝑅))
71, 5opprbasg 14464 . . . . 5 (𝑅 ∈ 𝑉 → (Base‘𝑅) = (Base‘𝑂))
81opprex 14462 . . . . . 6 (𝑅 ∈ 𝑉 → 𝑂 ∈ V)
9 eqid 2238 . . . . . . 7 (Base‘𝑂) = (Base‘𝑂)
103, 9opprbasg 14464 . . . . . 6 (𝑂 ∈ V → (Base‘𝑂) = (Base‘(oppr‘𝑂)))
118, 10syl 14 . . . . 5 (𝑅 ∈ 𝑉 → (Base‘𝑂) = (Base‘(oppr‘𝑂)))
127, 11eqtrd 2271 . . . 4 (𝑅 ∈ 𝑉 → (Base‘𝑅) = (Base‘(oppr‘𝑂)))
13 eqid 2238 . . . . . . 7 (+g‘𝑅) = (+g‘𝑅)
141, 13oppraddg 14465 . . . . . 6 (𝑅 ∈ 𝑉 → (+g‘𝑅) = (+g‘𝑂))
15 eqid 2238 . . . . . . . 8 (+g‘𝑂) = (+g‘𝑂)
163, 15oppraddg 14465 . . . . . . 7 (𝑂 ∈ V → (+g‘𝑂) = (+g‘(oppr‘𝑂)))
178, 16syl 14 . . . . . 6 (𝑅 ∈ 𝑉 → (+g‘𝑂) = (+g‘(oppr‘𝑂)))
1814, 17eqtrd 2271 . . . . 5 (𝑅 ∈ 𝑉 → (+g‘𝑅) = (+g‘(oppr‘𝑂)))
1918oveqdr 6113 . . . 4 ((𝑅 ∈ 𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑂))𝑦))
20 vex 2824 . . . . . . . 8 𝑥 ∈ V
2120a1i 9 . . . . . . 7 (𝑅 ∈ 𝑉 → 𝑥 ∈ V)
22 vex 2824 . . . . . . . 8 𝑦 ∈ V
2322a1i 9 . . . . . . 7 (𝑅 ∈ 𝑉 → 𝑦 ∈ V)
24 eqid 2238 . . . . . . . 8 (.r‘𝑂) = (.r‘𝑂)
25 eqid 2238 . . . . . . . 8 (.r‘(oppr‘𝑂)) = (.r‘(oppr‘𝑂))
269, 24, 3, 25opprmulg 14460 . . . . . . 7 ((𝑂 ∈ V ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥(.r‘(oppr‘𝑂))𝑦) = (𝑦(.r‘𝑂)𝑥))
278, 21, 23, 26syl3anc 1278 . . . . . 6 (𝑅 ∈ 𝑉 → (𝑥(.r‘(oppr‘𝑂))𝑦) = (𝑦(.r‘𝑂)𝑥))
2827adantr 276 . . . . 5 ((𝑅 ∈ 𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(.r‘(oppr‘𝑂))𝑦) = (𝑦(.r‘𝑂)𝑥))
29 simpl 109 . . . . . 6 ((𝑅 ∈ 𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑅 ∈ 𝑉)
30 simprr 537 . . . . . 6 ((𝑅 ∈ 𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑦 ∈ (Base‘𝑅))
31 simprl 535 . . . . . 6 ((𝑅 ∈ 𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑥 ∈ (Base‘𝑅))
32 eqid 2238 . . . . . . 7 (.r‘𝑅) = (.r‘𝑅)
335, 32, 1, 24opprmulg 14460 . . . . . 6 ((𝑅 ∈ 𝑉 ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑦(.r‘𝑂)𝑥) = (𝑥(.r‘𝑅)𝑦))
3429, 30, 31, 33syl3anc 1278 . . . . 5 ((𝑅 ∈ 𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑦(.r‘𝑂)𝑥) = (𝑥(.r‘𝑅)𝑦))
3528, 34eqtr2d 2272 . . . 4 ((𝑅 ∈ 𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(.r‘𝑅)𝑦) = (𝑥(.r‘(oppr‘𝑂))𝑦))
366, 12, 19, 35rngpropd 14338 . . 3 (𝑅 ∈ 𝑉 → (𝑅 ∈ Rng ↔ (oppr‘𝑂) ∈ Rng))
374, 36imbitrrid 156 . 2 (𝑅 ∈ 𝑉 → (𝑂 ∈ Rng → 𝑅 ∈ Rng))
382, 37impbid2 143 1 (𝑅 ∈ 𝑉 → (𝑅 ∈ Rng ↔ 𝑂 ∈ Rng))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  Vcvv 2821  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +gcplusg 13484  .rcmulr 13485  Rngcrng 14315  opprcoppr 14456
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-plusg 13497  df-mulr 13498  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-cmn 14173  df-abl 14174  df-mgp 14302  df-rng 14316  df-oppr 14457
This theorem is used by:  opprsubrngg  14603
  Copyright terms: Public domain W3C validator