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

Theorem iscom2 38753
Description: Obsolete theorem, used (as lemma) in other obsolete theorems only. A device to add commutativity to various sorts of rings. (Contributed by FL, 6-Sep-2009.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
iscom2 ((𝐺𝐴𝐻𝐵) → (⟨𝐺, 𝐻⟩ ∈ Com2 ↔ ∀𝑎 ∈ ran 𝐺𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎)))
Distinct variable groups:   𝐺,𝑎,𝑏   𝐻,𝑎,𝑏
Allowed substitution hints:   𝐴(𝑎, 𝑏)   𝐵(𝑎, 𝑏)

Proof of Theorem iscom2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-com2 38748 . . . 4 Com2 = {⟨𝑥, 𝑦⟩ ∣ ∀𝑎 ∈ ran 𝑥𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)}
21a1i 11 . . 3 ((𝐺𝐴𝐻𝐵) → Com2 = {⟨𝑥, 𝑦⟩ ∣ ∀𝑎 ∈ ran 𝑥𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)})
32eleq2d 2848 . 2 ((𝐺𝐴𝐻𝐵) → (⟨𝐺, 𝐻⟩ ∈ Com2 ↔ ⟨𝐺, 𝐻⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∀𝑎 ∈ ran 𝑥𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)}))
4 rneq 5924 . . . 4 (𝑥 = 𝐺 → ran 𝑥 = ran 𝐺)
54raleqdv 3321 . . . 4 (𝑥 = 𝐺 → (∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎)))
64, 5raleqbidv 3336 . . 3 (𝑥 = 𝐺 → (∀𝑎 ∈ ran 𝑥𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑎 ∈ ran 𝐺𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎)))
7 oveq 7423 . . . . 5 (𝑦 = 𝐻 → (𝑎𝑦𝑏) = (𝑎𝐻𝑏))
8 oveq 7423 . . . . 5 (𝑦 = 𝐻 → (𝑏𝑦𝑎) = (𝑏𝐻𝑎))
97, 8eqeq12d 2778 . . . 4 (𝑦 = 𝐻 → ((𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ (𝑎𝐻𝑏) = (𝑏𝐻𝑎)))
1092ralbidv 3228 . . 3 (𝑦 = 𝐻 → (∀𝑎 ∈ ran 𝐺𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑎 ∈ ran 𝐺𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎)))
116, 10opelopabg 5521 . 2 ((𝐺𝐴𝐻𝐵) → (⟨𝐺, 𝐻⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∀𝑎 ∈ ran 𝑥𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)} ↔ ∀𝑎 ∈ ran 𝐺𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎)))
123, 11bitrd 282 1 ((𝐺𝐴𝐻𝐵) → (⟨𝐺, 𝐻⟩ ∈ Com2 ↔ ∀𝑎 ∈ ran 𝐺𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wral 3078  cop 4593  {copab 5171  ran crn 5660  (class class class)co 7417  Com2ccm2 38747
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-cnv 5667  df-dm 5669  df-rn 5670  df-iota 6493  df-fv 6545  df-ov 7420  df-com2 38748
This theorem is used by:  iscrngo2  38755  iscringd  38756
  Copyright terms: Public domain W3C validator