Theorem isdivrngo 39150

Description: Obsolete theorem, use isdrng2 21048 instead. The predicate "is a division ring". (Contributed by FL, 6-Sep-2009.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
isdivrngo	⊢ (𝐻 ∈ 𝐴 → (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))

Proof of Theorem isdivrngo

Dummy variables 𝑔 ℎ 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-br 5109	. . . . 5 ⊢ (𝐺DivRingOps𝐻 ↔ ⟨𝐺, 𝐻⟩ ∈ DivRingOps)
2		df-drngo 39149	. . . . . . 7 ⊢ DivRingOps = {⟨𝑥, 𝑦⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ RingOps ∧ (𝑦 ↾ ((ran 𝑥 ∖ {(GId‘𝑥)}) × (ran 𝑥 ∖ {(GId‘𝑥)}))) ∈ GrpOp)}
3	2	relopabi 5809	. . . . . 6 ⊢ Rel DivRingOps
4	3	brrelex1i 5714	. . . . 5 ⊢ (𝐺DivRingOps𝐻 → 𝐺 ∈ V)
5	1, 4	sylbir 238	. . . 4 ⊢ (⟨𝐺, 𝐻⟩ ∈ DivRingOps → 𝐺 ∈ V)
6	5	anim1i 627	. . 3 ⊢ ((⟨𝐺, 𝐻⟩ ∈ DivRingOps ∧ 𝐻 ∈ 𝐴) → (𝐺 ∈ V ∧ 𝐻 ∈ 𝐴))
7	6	ancoms 464	. 2 ⊢ ((𝐻 ∈ 𝐴 ∧ ⟨𝐺, 𝐻⟩ ∈ DivRingOps) → (𝐺 ∈ V ∧ 𝐻 ∈ 𝐴))
8		rngoablo2 39109	. . . . 5 ⊢ (⟨𝐺, 𝐻⟩ ∈ RingOps → 𝐺 ∈ AbelOp)
9		elex 3475	. . . . 5 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ V)
10	8, 9	syl 18	. . . 4 ⊢ (⟨𝐺, 𝐻⟩ ∈ RingOps → 𝐺 ∈ V)
11	10	ad2antrl 741	. . 3 ⊢ ((𝐻 ∈ 𝐴 ∧ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)) → 𝐺 ∈ V)
12		simpl 488	. . 3 ⊢ ((𝐻 ∈ 𝐴 ∧ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)) → 𝐻 ∈ 𝐴)
13	11, 12	jca 521	. 2 ⊢ ((𝐻 ∈ 𝐴 ∧ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)) → (𝐺 ∈ V ∧ 𝐻 ∈ 𝐴))
14		df-drngo 39149	. . . 4 ⊢ DivRingOps = {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
15	14	eleq2i 2856	. . 3 ⊢ (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ ⟨𝐺, 𝐻⟩ ∈ {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)})
16		opeq1 4845	. . . . . 6 ⊢ (𝑔 = 𝐺 → ⟨𝑔, ℎ⟩ = ⟨𝐺, ℎ⟩)
17	16	eleq1d 2849	. . . . 5 ⊢ (𝑔 = 𝐺 → (⟨𝑔, ℎ⟩ ∈ RingOps ↔ ⟨𝐺, ℎ⟩ ∈ RingOps))
18		rneq 5930	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
19		fveq2 6916	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺))
20	19	sneqd 4596	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → {(GId‘𝑔)} = {(GId‘𝐺)})
21	18, 20	difeq12d 4067	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (ran 𝑔 ∖ {(GId‘𝑔)}) = (ran 𝐺 ∖ {(GId‘𝐺)}))
22	21	sqxpeqd 5690	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)})) = ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)})))
23	22	reseq2d 5986	. . . . . 6 ⊢ (𝑔 = 𝐺 → (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) = (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))))
24	23	eleq1d 2849	. . . . 5 ⊢ (𝑔 = 𝐺 → ((ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp ↔ (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp))
25	17, 24	anbi12d 644	. . . 4 ⊢ (𝑔 = 𝐺 → ((⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp) ↔ (⟨𝐺, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))
26		opeq2 4846	. . . . . 6 ⊢ (ℎ = 𝐻 → ⟨𝐺, ℎ⟩ = ⟨𝐺, 𝐻⟩)
27	26	eleq1d 2849	. . . . 5 ⊢ (ℎ = 𝐻 → (⟨𝐺, ℎ⟩ ∈ RingOps ↔ ⟨𝐺, 𝐻⟩ ∈ RingOps))
28		reseq1 5980	. . . . . 6 ⊢ (ℎ = 𝐻 → (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) = (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))))
29	28	eleq1d 2849	. . . . 5 ⊢ (ℎ = 𝐻 → ((ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp ↔ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp))
30	27, 29	anbi12d 644	. . . 4 ⊢ (ℎ = 𝐻 → ((⟨𝐺, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp) ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))
31	25, 30	opelopabg 5520	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ 𝐴) → (⟨𝐺, 𝐻⟩ ∈ {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)} ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))
32	15, 31	bitrid 286	. 2 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ 𝐴) → (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))
33	7, 13, 32	pm5.21nd 814	1 ⊢ (𝐻 ∈ 𝐴 → (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048  {csn 4588  ⟨cop 4840   class class class wbr 5108  {copab 5173   × cxp 5656  ran crn 5659   ↾ cres 5660  ‘cfv 6566  GrpOpcgr 31148  GIdcgi 31149  AbelOpcablo 31203  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:  zrdivrng  39153  isdrngo1  39156