Theorem isdivrngo 38659

Description: Obsolete theorem, use isdrng2 20893 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 5112	. . . . 5 ⊢ (𝐺DivRingOps𝐻 ↔ ⟨𝐺, 𝐻⟩ ∈ DivRingOps)
2		df-drngo 38658	. . . . . . 7 ⊢ DivRingOps = {⟨𝑥, 𝑦⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ RingOps ∧ (𝑦 ↾ ((ran 𝑥 ∖ {(GId‘𝑥)}) × (ran 𝑥 ∖ {(GId‘𝑥)}))) ∈ GrpOp)}
3	2	relopabiv 5809	. . . . . 6 ⊢ Rel DivRingOps
4	3	brrelex1i 5719	. . . . 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 38618	. . . . 5 ⊢ (⟨𝐺, 𝐻⟩ ∈ RingOps → 𝐺 ∈ AbelOp)
9		elex 3478	. . . . 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 38658	. . . 4 ⊢ DivRingOps = {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
15	14	eleq2i 2857	. . 3 ⊢ (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ ⟨𝐺, 𝐻⟩ ∈ {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)})
16		opeq1 4840	. . . . . 6 ⊢ (𝑔 = 𝐺 → ⟨𝑔, ℎ⟩ = ⟨𝐺, ℎ⟩)
17	16	eleq1d 2850	. . . . 5 ⊢ (𝑔 = 𝐺 → (⟨𝑔, ℎ⟩ ∈ RingOps ↔ ⟨𝐺, ℎ⟩ ∈ RingOps))
18		rneq 5928	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
19		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺))
20	19	sneqd 4603	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → {(GId‘𝑔)} = {(GId‘𝐺)})
21	18, 20	difeq12d 4082	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (ran 𝑔 ∖ {(GId‘𝑔)}) = (ran 𝐺 ∖ {(GId‘𝐺)}))
22	21	sqxpeqd 5695	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)})) = ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)})))
23	22	reseq2d 5980	. . . . . 6 ⊢ (𝑔 = 𝐺 → (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) = (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))))
24	23	eleq1d 2850	. . . . 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 4841	. . . . . 6 ⊢ (ℎ = 𝐻 → ⟨𝐺, ℎ⟩ = ⟨𝐺, 𝐻⟩)
27	26	eleq1d 2850	. . . . 5 ⊢ (ℎ = 𝐻 → (⟨𝐺, ℎ⟩ ∈ RingOps ↔ ⟨𝐺, 𝐻⟩ ∈ RingOps))
28		reseq1 5974	. . . . . 6 ⊢ (ℎ = 𝐻 → (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) = (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))))
29	28	eleq1d 2850	. . . . 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 5525	. . 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 2146  Vcvv 3457   ∖ cdif 3903  {csn 4591  ⟨cop 4597   class class class wbr 5111  {copab 5175   × cxp 5661  ran crn 5664   ↾ cres 5665  ‘cfv 6540  GrpOpcgr 30912  GIdcgi 30913  AbelOpcablo 30967  RingOpscrngo 38603  DivRingOpscdrng 38657

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-1st 7992  df-2nd 7993  df-rngo 38604  df-drngo 38658

This theorem is used by:  zrdivrng  38662  isdrngo1  38665