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

Theorem isdrngo1 38607
Description: Obsolete theorem, use isdrng2 20843 instead. The predicate "is a division ring". (Contributed by Jeff Madsen, 8-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
isdivrng1.1 𝐺 = (1st𝑅)
isdivrng1.2 𝐻 = (2nd𝑅)
isdivrng1.3 𝑍 = (GId‘𝐺)
isdivrng1.4 𝑋 = ran 𝐺
Assertion
Ref Expression
isdrngo1 (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))

Proof of Theorem isdrngo1
Dummy variables 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-drngo 38600 . . . 4 DivRingOps = {⟨𝑔, ⟩ ∣ (⟨𝑔, ⟩ ∈ RingOps ∧ ( ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
21relopabiv 5807 . . 3 Rel DivRingOps
3 1st2nd 8032 . . 3 ((Rel DivRingOps ∧ 𝑅 ∈ DivRingOps) → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
42, 3mpan 702 . 2 (𝑅 ∈ DivRingOps → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
5 relrngo 38547 . . . 4 Rel RingOps
6 1st2nd 8032 . . . 4 ((Rel RingOps ∧ 𝑅 ∈ RingOps) → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
75, 6mpan 702 . . 3 (𝑅 ∈ RingOps → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
87adantr 485 . 2 ((𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
9 isdivrng1.1 . . . . 5 𝐺 = (1st𝑅)
10 isdivrng1.2 . . . . 5 𝐻 = (2nd𝑅)
119, 10opeq12i 4843 . . . 4 𝐺, 𝐻⟩ = ⟨(1st𝑅), (2nd𝑅)⟩
1211eqeq2i 2776 . . 3 (𝑅 = ⟨𝐺, 𝐻⟩ ↔ 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
1310fvexi 6895 . . . . . 6 𝐻 ∈ V
14 isdivrngo 38601 . . . . . 6 (𝐻 ∈ V → (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))
1513, 14ax-mp 5 . . . . 5 (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp))
16 isdivrng1.4 . . . . . . . . . 10 𝑋 = ran 𝐺
17 isdivrng1.3 . . . . . . . . . . 11 𝑍 = (GId‘𝐺)
1817sneqi 4600 . . . . . . . . . 10 {𝑍} = {(GId‘𝐺)}
1916, 18difeq12i 4079 . . . . . . . . 9 (𝑋 ∖ {𝑍}) = (ran 𝐺 ∖ {(GId‘𝐺)})
2019, 19xpeq12i 5689 . . . . . . . 8 ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍})) = ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))
2120reseq2i 5975 . . . . . . 7 (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) = (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)})))
2221eleq1i 2854 . . . . . 6 ((𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp ↔ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)
2322anbi2i 634 . . . . 5 ((⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp))
2415, 23bitr4i 281 . . . 4 (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))
25 eleq1 2851 . . . . 5 (𝑅 = ⟨𝐺, 𝐻⟩ → (𝑅 ∈ DivRingOps ↔ ⟨𝐺, 𝐻⟩ ∈ DivRingOps))
26 eleq1 2851 . . . . . 6 (𝑅 = ⟨𝐺, 𝐻⟩ → (𝑅 ∈ RingOps ↔ ⟨𝐺, 𝐻⟩ ∈ RingOps))
2726anbi1d 642 . . . . 5 (𝑅 = ⟨𝐺, 𝐻⟩ → ((𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
2825, 27bibi12d 348 . . . 4 (𝑅 = ⟨𝐺, 𝐻⟩ → ((𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)) ↔ (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))))
2924, 28mpbiri 261 . . 3 (𝑅 = ⟨𝐺, 𝐻⟩ → (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
3012, 29sylbir 238 . 2 (𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩ → (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp)))
314, 8, 30pm5.21nii 381 1 (𝑅 ∈ DivRingOps ↔ (𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1570  wcel 2143  Vcvv 3455  cdif 3902  {csn 4589  cop 4595   × cxp 5659  ran crn 5662  cres 5663  Rel wrel 5666  cfv 6536  1st c1st 7980  2nd c2nd 7981  GrpOpcgr 30841  GIdcgi 30842  RingOpscrngo 38545  DivRingOpscdrng 38599
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-1st 7982  df-2nd 7983  df-rngo 38546  df-drngo 38600
This theorem is referenced by:  divrngcl  38608  isdrngo2  38609  divrngpr  38704
  Copyright terms: Public domain W3C validator