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 39027
Description: Obsolete theorem, use isdrng2 21006 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 39020 . . . 4 DivRingOps = {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
21relopabiv 5799 . . 3 Rel DivRingOps
3 1st2nd 8054 . . 3 ((Rel DivRingOps ∧ 𝑅 ∈ DivRingOps) → 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
42, 3mpan 703 . 2 (𝑅 ∈ DivRingOps → 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
5 relrngo 38967 . . . 4 Rel RingOps
6 1st2nd 8054 . . . 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 4844 . . . 4 ⟨𝐺, 𝐻⟩ = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩
1211eqeq2i 2773 . . 3 (𝑅 = ⟨𝐺, 𝐻⟩ ↔ 𝑅 = ⟨(1st ‘𝑅), (2nd ‘𝑅)⟩)
1310fvexi 6904 . . . . . 6 𝐻 ∈ V
14 isdivrngo 39021 . . . . . 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 4591 . . . . . . . . . 10 {𝑍} = {(GId‘𝐺)}
1916, 18difeq12i 4060 . . . . . . . . 9 (𝑋 ∖ {𝑍}) = (ran 𝐺 ∖ {(GId‘𝐺)})
2019, 19xpeq12i 5679 . . . . . . . 8 ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍})) = ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))
2120reseq2i 5968 . . . . . . 7 (𝐻 ↾ ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍}))) = (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)})))
2221eleq1i 2851 . . . . . 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 2848 . . . . 5 (𝑅 = ⟨𝐺, 𝐻⟩ → (𝑅 ∈ DivRingOps ↔ ⟨𝐺, 𝐻⟩ ∈ DivRingOps))
26 eleq1 2848 . . . . . 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 1569   ∈ wcel 2144  Vcvv 3450   ∖ cdif 4044  {csn 4584  ⟨cop 4834   × cxp 5649  ran crn 5652   ↾ cres 5653  Rel wrel 5656  ‘cfv 6543  1st c1st 8003  2nd c2nd 8004  GrpOpcgr 31100  GIdcgi 31101  RingOpscrngo 38965  DivRingOpscdrng 39019
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7427  df-1st 8005  df-2nd 8006  df-rngo 38966  df-drngo 39020
This theorem is used by:  divrngcl  39028  isdrngo2  39029  divrngpr  39124
  Copyright terms: Public domain W3C validator