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 39156
Description: Obsolete theorem, use isdrng2 21048 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 39149 . . . 4 DivRingOps = {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
21relopabi 5809 . . 3 Rel DivRingOps
3 1st2nd 8084 . . 3 ((Rel DivRingOps ∧ 𝑅 ∈ DivRingOps) → 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
42, 3mpan 703 . 2 (𝑅 ∈ DivRingOps → 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
5 relrngo 39096 . . . 4 Rel RingOps
6 1st2nd 8084 . . . 4 ((Rel RingOps ∧ 𝑅 ∈ RingOps) → 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
75, 6mpan 703 . . 3 (𝑅 ∈ RingOps → 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
87adantr 486 . 2 ((𝑅 ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) → 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
9 isdivrng1.1 . . . . 5 𝐺 = (1st ‘𝑅)
10 isdivrng1.2 . . . . 5 𝐻 = (2nd ‘𝑅)
119, 10opeq12i 4850 . . . 4 ⟨𝐺, 𝐻⟩ = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩
1211eqeq2i 2776 . . 3 (𝑅 = ⟨𝐺, 𝐻⟩ ↔ 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
1310fvexi 6930 . . . . . 6 𝐻 ∈ V
14 isdivrngo 39150 . . . . . 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 4595 . . . . . . . . . 10 {𝑍} = {(GId‘𝐺)}
1916, 18difeq12i 4064 . . . . . . . . 9 (𝑋 ∖ {𝑍}) = (ran 𝐺 ∖ {(GId‘𝐺)})
2019, 19xpeq12i 5686 . . . . . . . 8 ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍})) = ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))
2120reseq2i 5983 . . . . . . 7 (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) = (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)})))
2221eleq1i 2855 . . . . . 6 ((𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp ↔ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)
2322anbi2i 635 . . . . 5 ((⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp) ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp))
2415, 23bitr4i 281 . . . 4 (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) ∈ GrpOp))
25 eleq1 2852 . . . . 5 (𝑅 = ⟨𝐺, 𝐻⟩ → (𝑅 ∈ DivRingOps ↔ ⟨𝐺, 𝐻⟩ ∈ DivRingOps))
26 eleq1 2852 . . . . . 6 (𝑅 = ⟨𝐺, 𝐻⟩ → (𝑅 ∈ RingOps ↔ ⟨𝐺, 𝐻⟩ ∈ RingOps))
2726anbi1d 643 . . . . 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
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048  {csn 4588  ⟨cop 4840   × cxp 5656  ran crn 5659   ↾ cres 5660  Rel wrel 5663  ‘cfv 6566  1st c1st 8033  2nd c2nd 8034  GrpOpcgr 31148  GIdcgi 31149  RingOpscrngo 39094  DivRingOpscdrng 39148
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-1st 8035  df-2nd 8036  df-rngo 39095  df-drngo 39149
This theorem is used by:  divrngcl  39157  isdrngo2  39158  divrngpr  39253
  Copyright terms: Public domain W3C validator