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

Theorem opprrngbg 13955
Description: A set is a non-unital ring if and only if its opposite is a non-unital ring. Bidirectional form of opprrng 13954. (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 13954 . 2 (𝑅 ∈ Rng → 𝑂 ∈ Rng)
3 eqid 2207 . . . 4 (oppr𝑂) = (oppr𝑂)
43opprrng 13954 . . 3 (𝑂 ∈ Rng → (oppr𝑂) ∈ Rng)
5 eqid 2207 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
65a1i 9 . . . 4 (𝑅𝑉 → (Base‘𝑅) = (Base‘𝑅))
71, 5opprbasg 13952 . . . . 5 (𝑅𝑉 → (Base‘𝑅) = (Base‘𝑂))
81opprex 13950 . . . . . 6 (𝑅𝑉𝑂 ∈ V)
9 eqid 2207 . . . . . . 7 (Base‘𝑂) = (Base‘𝑂)
103, 9opprbasg 13952 . . . . . 6 (𝑂 ∈ V → (Base‘𝑂) = (Base‘(oppr𝑂)))
118, 10syl 14 . . . . 5 (𝑅𝑉 → (Base‘𝑂) = (Base‘(oppr𝑂)))
127, 11eqtrd 2240 . . . 4 (𝑅𝑉 → (Base‘𝑅) = (Base‘(oppr𝑂)))
13 eqid 2207 . . . . . . 7 (+g𝑅) = (+g𝑅)
141, 13oppraddg 13953 . . . . . 6 (𝑅𝑉 → (+g𝑅) = (+g𝑂))
15 eqid 2207 . . . . . . . 8 (+g𝑂) = (+g𝑂)
163, 15oppraddg 13953 . . . . . . 7 (𝑂 ∈ V → (+g𝑂) = (+g‘(oppr𝑂)))
178, 16syl 14 . . . . . 6 (𝑅𝑉 → (+g𝑂) = (+g‘(oppr𝑂)))
1814, 17eqtrd 2240 . . . . 5 (𝑅𝑉 → (+g𝑅) = (+g‘(oppr𝑂)))
1918oveqdr 5995 . . . 4 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑂))𝑦))
20 vex 2779 . . . . . . . 8 𝑥 ∈ V
2120a1i 9 . . . . . . 7 (𝑅𝑉𝑥 ∈ V)
22 vex 2779 . . . . . . . 8 𝑦 ∈ V
2322a1i 9 . . . . . . 7 (𝑅𝑉𝑦 ∈ V)
24 eqid 2207 . . . . . . . 8 (.r𝑂) = (.r𝑂)
25 eqid 2207 . . . . . . . 8 (.r‘(oppr𝑂)) = (.r‘(oppr𝑂))
269, 24, 3, 25opprmulg 13948 . . . . . . 7 ((𝑂 ∈ V ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥(.r‘(oppr𝑂))𝑦) = (𝑦(.r𝑂)𝑥))
278, 21, 23, 26syl3anc 1250 . . . . . 6 (𝑅𝑉 → (𝑥(.r‘(oppr𝑂))𝑦) = (𝑦(.r𝑂)𝑥))
2827adantr 276 . . . . 5 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(.r‘(oppr𝑂))𝑦) = (𝑦(.r𝑂)𝑥))
29 simpl 109 . . . . . 6 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑅𝑉)
30 simprr 531 . . . . . 6 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑦 ∈ (Base‘𝑅))
31 simprl 529 . . . . . 6 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → 𝑥 ∈ (Base‘𝑅))
32 eqid 2207 . . . . . . 7 (.r𝑅) = (.r𝑅)
335, 32, 1, 24opprmulg 13948 . . . . . 6 ((𝑅𝑉𝑦 ∈ (Base‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑦(.r𝑂)𝑥) = (𝑥(.r𝑅)𝑦))
3429, 30, 31, 33syl3anc 1250 . . . . 5 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑦(.r𝑂)𝑥) = (𝑥(.r𝑅)𝑦))
3528, 34eqtr2d 2241 . . . 4 ((𝑅𝑉 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(.r𝑅)𝑦) = (𝑥(.r‘(oppr𝑂))𝑦))
366, 12, 19, 35rngpropd 13832 . . 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 1373  wcel 2178  Vcvv 2776  cfv 5290  (class class class)co 5967  Basecbs 12947  +gcplusg 13024  .rcmulr 13025  Rngcrng 13809  opprcoppr 13944
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-i2m1 8065  ax-0lt1 8066  ax-0id 8068  ax-rnegex 8069  ax-pre-ltirr 8072  ax-pre-lttrn 8074  ax-pre-ltadd 8076
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-tpos 6354  df-pnf 8144  df-mnf 8145  df-ltxr 8147  df-inn 9072  df-2 9130  df-3 9131  df-ndx 12950  df-slot 12951  df-base 12953  df-sets 12954  df-plusg 13037  df-mulr 13038  df-0g 13205  df-mgm 13303  df-sgrp 13349  df-mnd 13364  df-grp 13450  df-cmn 13737  df-abl 13738  df-mgp 13798  df-rng 13810  df-oppr 13945
This theorem is referenced by:  opprsubrngg  14088
  Copyright terms: Public domain W3C validator