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 38707
Description: Obsolete theorem, use isdrng2 20907 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 38700 . . . 4 DivRingOps = {⟨𝑔, ⟩ ∣ (⟨𝑔, ⟩ ∈ RingOps ∧ ( ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
21relopabiv 5801 . . 3 Rel DivRingOps
3 1st2nd 8037 . . 3 ((Rel DivRingOps ∧ 𝑅 ∈ DivRingOps) → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
42, 3mpan 703 . 2 (𝑅 ∈ DivRingOps → 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
5 relrngo 38647 . . . 4 Rel RingOps
6 1st2nd 8037 . . . 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 4838 . . . 4 𝐺, 𝐻⟩ = ⟨(1st𝑅), (2nd𝑅)⟩
1211eqeq2i 2773 . . 3 (𝑅 = ⟨𝐺, 𝐻⟩ ↔ 𝑅 = ⟨(1st𝑅), (2nd𝑅)⟩)
1310fvexi 6893 . . . . . 6 𝐻 ∈ V
14 isdivrngo 38701 . . . . . 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 4072 . . . . . . . . 9 (𝑋 ∖ {𝑍}) = (ran 𝐺 ∖ {(GId‘𝐺)})
2019, 19xpeq12i 5683 . . . . . . . 8 ((𝑋 ∖ {𝑍}) × (𝑋 ∖ {𝑍})) = ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))
2120reseq2i 5969 . . . . . . 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 1570  wcel 2145  Vcvv 3450  cdif 3896  {csn 4584  cop 4590   × cxp 5653  ran crn 5656  cres 5657  Rel wrel 5660  cfv 6533  1st c1st 7985  2nd c2nd 7986  GrpOpcgr 30971  GIdcgi 30972  RingOpscrngo 38645  DivRingOpscdrng 38699
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-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737
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-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  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-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-1st 7987  df-2nd 7988  df-rngo 38646  df-drngo 38700
This theorem is used by:  divrngcl  38708  isdrngo2  38709  divrngpr  38804
  Copyright terms: Public domain W3C validator