Mathbox for Jeff Madsen < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iscrngo2 Structured version   Visualization version   GIF version

Theorem iscrngo2 33467
 Description: The predicate "is a commutative ring". (Contributed by Jeff Madsen, 8-Jun-2010.)
Hypotheses
Ref Expression
iscring2.1 𝐺 = (1st𝑅)
iscring2.2 𝐻 = (2nd𝑅)
iscring2.3 𝑋 = ran 𝐺
Assertion
Ref Expression
iscrngo2 (𝑅 ∈ CRingOps ↔ (𝑅 ∈ RingOps ∧ ∀𝑥𝑋𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥)))
Distinct variable groups:   𝑥,𝑅,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐺(𝑥,𝑦)   𝐻(𝑥,𝑦)

Proof of Theorem iscrngo2
StepHypRef Expression
1 iscrngo 33466 . 2 (𝑅 ∈ CRingOps ↔ (𝑅 ∈ RingOps ∧ 𝑅 ∈ Com2))
2 relrngo 33366 . . . . 5 Rel RingOps
3 1st2nd 7174 . . . . 5 ((Rel RingOps ∧ 𝑅 ∈ RingOps) → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
42, 3mpan 705 . . . 4 (𝑅 ∈ RingOps → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
5 eleq1 2686 . . . . 5 (𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩ → (𝑅 ∈ Com2 ↔ ⟨(1st𝑅), (2nd𝑅)⟩ ∈ Com2))
6 iscring2.3 . . . . . . . 8 𝑋 = ran 𝐺
7 iscring2.1 . . . . . . . . 9 𝐺 = (1st𝑅)
87rneqi 5322 . . . . . . . 8 ran 𝐺 = ran (1st𝑅)
96, 8eqtri 2643 . . . . . . 7 𝑋 = ran (1st𝑅)
109raleqi 3135 . . . . . 6 (∀𝑥𝑋𝑦 ∈ ran (1st𝑅)(𝑥(2nd𝑅)𝑦) = (𝑦(2nd𝑅)𝑥) ↔ ∀𝑥 ∈ ran (1st𝑅)∀𝑦 ∈ ran (1st𝑅)(𝑥(2nd𝑅)𝑦) = (𝑦(2nd𝑅)𝑥))
11 iscring2.2 . . . . . . . . . 10 𝐻 = (2nd𝑅)
1211oveqi 6628 . . . . . . . . 9 (𝑥𝐻𝑦) = (𝑥(2nd𝑅)𝑦)
1311oveqi 6628 . . . . . . . . 9 (𝑦𝐻𝑥) = (𝑦(2nd𝑅)𝑥)
1412, 13eqeq12i 2635 . . . . . . . 8 ((𝑥𝐻𝑦) = (𝑦𝐻𝑥) ↔ (𝑥(2nd𝑅)𝑦) = (𝑦(2nd𝑅)𝑥))
159, 14raleqbii 2986 . . . . . . 7 (∀𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥) ↔ ∀𝑦 ∈ ran (1st𝑅)(𝑥(2nd𝑅)𝑦) = (𝑦(2nd𝑅)𝑥))
1615ralbii 2976 . . . . . 6 (∀𝑥𝑋𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥) ↔ ∀𝑥𝑋𝑦 ∈ ran (1st𝑅)(𝑥(2nd𝑅)𝑦) = (𝑦(2nd𝑅)𝑥))
17 fvex 6168 . . . . . . 7 (1st𝑅) ∈ V
18 fvex 6168 . . . . . . 7 (2nd𝑅) ∈ V
19 iscom2 33465 . . . . . . 7 (((1st𝑅) ∈ V ∧ (2nd𝑅) ∈ V) → (⟨(1st𝑅), (2nd𝑅)⟩ ∈ Com2 ↔ ∀𝑥 ∈ ran (1st𝑅)∀𝑦 ∈ ran (1st𝑅)(𝑥(2nd𝑅)𝑦) = (𝑦(2nd𝑅)𝑥)))
2017, 18, 19mp2an 707 . . . . . 6 (⟨(1st𝑅), (2nd𝑅)⟩ ∈ Com2 ↔ ∀𝑥 ∈ ran (1st𝑅)∀𝑦 ∈ ran (1st𝑅)(𝑥(2nd𝑅)𝑦) = (𝑦(2nd𝑅)𝑥))
2110, 16, 203bitr4ri 293 . . . . 5 (⟨(1st𝑅), (2nd𝑅)⟩ ∈ Com2 ↔ ∀𝑥𝑋𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥))
225, 21syl6bb 276 . . . 4 (𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩ → (𝑅 ∈ Com2 ↔ ∀𝑥𝑋𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥)))
234, 22syl 17 . . 3 (𝑅 ∈ RingOps → (𝑅 ∈ Com2 ↔ ∀𝑥𝑋𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥)))
2423pm5.32i 668 . 2 ((𝑅 ∈ RingOps ∧ 𝑅 ∈ Com2) ↔ (𝑅 ∈ RingOps ∧ ∀𝑥𝑋𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥)))
251, 24bitri 264 1 (𝑅 ∈ CRingOps ↔ (𝑅 ∈ RingOps ∧ ∀𝑥𝑋𝑦𝑋 (𝑥𝐻𝑦) = (𝑦𝐻𝑥)))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 384   = wceq 1480   ∈ wcel 1987  ∀wral 2908  Vcvv 3190  ⟨cop 4161  ran crn 5085  Rel wrel 5089  ‘cfv 5857  (class class class)co 6615  1st c1st 7126  2nd c2nd 7127  RingOpscrngo 33364  Com2ccm2 33459  CRingOpsccring 33463 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-iota 5820  df-fun 5859  df-fv 5865  df-ov 6618  df-1st 7128  df-2nd 7129  df-rngo 33365  df-com2 33460  df-crngo 33464 This theorem is referenced by:  crngocom  33471  crngohomfo  33476
 Copyright terms: Public domain W3C validator