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

Theorem isrngod 38648
Description: Obsolete theorem, use isringd 20433 instead. Conditions that determine a ring. (Changed label from isringd 20433 to isrngod 38648-NM 2-Aug-2013.) (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 21-Dec-2013.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
isringod.1 (𝜑𝐺 ∈ AbelOp)
isringod.2 (𝜑𝑋 = ran 𝐺)
isringod.3 (𝜑𝐻:(𝑋 × 𝑋)⟶𝑋)
isringod.4 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → ((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)))
isringod.5 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)))
isringod.6 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧)))
isringod.7 (𝜑𝑈𝑋)
isringod.8 ((𝜑𝑦𝑋) → (𝑈𝐻𝑦) = 𝑦)
isringod.9 ((𝜑𝑦𝑋) → (𝑦𝐻𝑈) = 𝑦)
Assertion
Ref Expression
isrngod (𝜑 → ⟨𝐺, 𝐻⟩ ∈ RingOps)
Distinct variable groups:   𝜑,𝑥,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧   𝑥,𝑈,𝑦
Allowed substitution hint:   𝑈(𝑧)

Proof of Theorem isrngod
StepHypRef Expression
1 isringod.1 . . 3 (𝜑𝐺 ∈ AbelOp)
2 isringod.3 . . . 4 (𝜑𝐻:(𝑋 × 𝑋)⟶𝑋)
3 isringod.2 . . . . . 6 (𝜑𝑋 = ran 𝐺)
43sqxpeqd 5687 . . . . 5 (𝜑 → (𝑋 × 𝑋) = (ran 𝐺 × ran 𝐺))
54, 3feq23d 6697 . . . 4 (𝜑 → (𝐻:(𝑋 × 𝑋)⟶𝑋𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺))
62, 5mpbid 235 . . 3 (𝜑𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
7 isringod.4 . . . . . . 7 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → ((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)))
8 isringod.5 . . . . . . 7 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)))
9 isringod.6 . . . . . . 7 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧)))
107, 8, 93jca 1146 . . . . . 6 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))))
1110ralrimivvva 3208 . . . . 5 (𝜑 → ∀𝑥𝑋𝑦𝑋𝑧𝑋 (((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))))
123raleqdv 3319 . . . . . . 7 (𝜑 → (∀𝑧𝑋 (((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))) ↔ ∀𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧)))))
133, 12raleqbidv 3334 . . . . . 6 (𝜑 → (∀𝑦𝑋𝑧𝑋 (((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))) ↔ ∀𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧)))))
143, 13raleqbidv 3334 . . . . 5 (𝜑 → (∀𝑥𝑋𝑦𝑋𝑧𝑋 (((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧)))))
1511, 14mpbid 235 . . . 4 (𝜑 → ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))))
16 isringod.7 . . . . . 6 (𝜑𝑈𝑋)
17 isringod.8 . . . . . . . 8 ((𝜑𝑦𝑋) → (𝑈𝐻𝑦) = 𝑦)
18 isringod.9 . . . . . . . 8 ((𝜑𝑦𝑋) → (𝑦𝐻𝑈) = 𝑦)
1917, 18jca 521 . . . . . . 7 ((𝜑𝑦𝑋) → ((𝑈𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑈) = 𝑦))
2019ralrimiva 3154 . . . . . 6 (𝜑 → ∀𝑦𝑋 ((𝑈𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑈) = 𝑦))
21 oveq1 7420 . . . . . . . . 9 (𝑥 = 𝑈 → (𝑥𝐻𝑦) = (𝑈𝐻𝑦))
2221eqeq1d 2762 . . . . . . . 8 (𝑥 = 𝑈 → ((𝑥𝐻𝑦) = 𝑦 ↔ (𝑈𝐻𝑦) = 𝑦))
2322ovanraleqv 7437 . . . . . . 7 (𝑥 = 𝑈 → (∀𝑦𝑋 ((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦) ↔ ∀𝑦𝑋 ((𝑈𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑈) = 𝑦)))
2423rspcev 3576 . . . . . 6 ((𝑈𝑋 ∧ ∀𝑦𝑋 ((𝑈𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑈) = 𝑦)) → ∃𝑥𝑋𝑦𝑋 ((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦))
2516, 20, 24syl2anc 596 . . . . 5 (𝜑 → ∃𝑥𝑋𝑦𝑋 ((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦))
263raleqdv 3319 . . . . . 6 (𝜑 → (∀𝑦𝑋 ((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦) ↔ ∀𝑦 ∈ ran 𝐺((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦)))
273, 26rexeqbidv 3335 . . . . 5 (𝜑 → (∃𝑥𝑋𝑦𝑋 ((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦) ↔ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦)))
2825, 27mpbid 235 . . . 4 (𝜑 → ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦))
2915, 28jca 521 . . 3 (𝜑 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦)))
301, 6, 29jca31 524 . 2 (𝜑 → ((𝐺 ∈ AbelOp ∧ 𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺) ∧ (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦))))
31 rnexg 7899 . . . . . 6 (𝐺 ∈ AbelOp → ran 𝐺 ∈ V)
321, 31syl 18 . . . . 5 (𝜑 → ran 𝐺 ∈ V)
3332, 32xpexd 7750 . . . 4 (𝜑 → (ran 𝐺 × ran 𝐺) ∈ V)
346, 33fexd 7226 . . 3 (𝜑𝐻 ∈ V)
35 eqid 2760 . . . 4 ran 𝐺 = ran 𝐺
3635isrngo 38647 . . 3 (𝐻 ∈ V → (⟨𝐺, 𝐻⟩ ∈ RingOps ↔ ((𝐺 ∈ AbelOp ∧ 𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺) ∧ (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦)))))
3734, 36syl 18 . 2 (𝜑 → (⟨𝐺, 𝐻⟩ ∈ RingOps ↔ ((𝐺 ∈ AbelOp ∧ 𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺) ∧ (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺(((𝑥𝐻𝑦)𝐻𝑧) = (𝑥𝐻(𝑦𝐻𝑧)) ∧ (𝑥𝐻(𝑦𝐺𝑧)) = ((𝑥𝐻𝑦)𝐺(𝑥𝐻𝑧)) ∧ ((𝑥𝐺𝑦)𝐻𝑧) = ((𝑥𝐻𝑧)𝐺(𝑦𝐻𝑧))) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐻𝑦) = 𝑦 ∧ (𝑦𝐻𝑥) = 𝑦)))))
3830, 37mpbird 260 1 (𝜑 → ⟨𝐺, 𝐻⟩ ∈ RingOps)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3076  wrex 3086  Vcvv 3450  cop 4590   × cxp 5653  ran crn 5656  wf 6529  (class class class)co 7413  AbelOpcablo 31025  RingOpscrngo 38644
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
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-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-rngo 38645
This theorem is used by:  iscringd  38748
  Copyright terms: Public domain W3C validator