Theorem isdivrngo 38601

Description: Obsolete theorem, use isdrng2 20843 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 5110	. . . . 5 ⊢ (𝐺DivRingOps𝐻 ↔ ⟨𝐺, 𝐻⟩ ∈ DivRingOps)
2		df-drngo 38600	. . . . . . 7 ⊢ DivRingOps = {⟨𝑥, 𝑦⟩ ∣ (⟨𝑥, 𝑦⟩ ∈ RingOps ∧ (𝑦 ↾ ((ran 𝑥 ∖ {(GId‘𝑥)}) × (ran 𝑥 ∖ {(GId‘𝑥)}))) ∈ GrpOp)}
3	2	relopabiv 5807	. . . . . 6 ⊢ Rel DivRingOps
4	3	brrelex1i 5717	. . . . 5 ⊢ (𝐺DivRingOps𝐻 → 𝐺 ∈ V)
5	1, 4	sylbir 238	. . . 4 ⊢ (⟨𝐺, 𝐻⟩ ∈ DivRingOps → 𝐺 ∈ V)
6	5	anim1i 626	. . 3 ⊢ ((⟨𝐺, 𝐻⟩ ∈ DivRingOps ∧ 𝐻 ∈ 𝐴) → (𝐺 ∈ V ∧ 𝐻 ∈ 𝐴))
7	6	ancoms 463	. 2 ⊢ ((𝐻 ∈ 𝐴 ∧ ⟨𝐺, 𝐻⟩ ∈ DivRingOps) → (𝐺 ∈ V ∧ 𝐻 ∈ 𝐴))
8		rngoablo2 38560	. . . . 5 ⊢ (⟨𝐺, 𝐻⟩ ∈ RingOps → 𝐺 ∈ AbelOp)
9		elex 3476	. . . . 5 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ V)
10	8, 9	syl 18	. . . 4 ⊢ (⟨𝐺, 𝐻⟩ ∈ RingOps → 𝐺 ∈ V)
11	10	ad2antrl 740	. . 3 ⊢ ((𝐻 ∈ 𝐴 ∧ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)) → 𝐺 ∈ V)
12		simpl 487	. . 3 ⊢ ((𝐻 ∈ 𝐴 ∧ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)) → 𝐻 ∈ 𝐴)
13	11, 12	jca 520	. 2 ⊢ ((𝐻 ∈ 𝐴 ∧ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)) → (𝐺 ∈ V ∧ 𝐻 ∈ 𝐴))
14		df-drngo 38600	. . . 4 ⊢ DivRingOps = {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)}
15	14	eleq2i 2855	. . 3 ⊢ (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ ⟨𝐺, 𝐻⟩ ∈ {⟨𝑔, ℎ⟩ ∣ (⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp)})
16		opeq1 4838	. . . . . 6 ⊢ (𝑔 = 𝐺 → ⟨𝑔, ℎ⟩ = ⟨𝐺, ℎ⟩)
17	16	eleq1d 2848	. . . . 5 ⊢ (𝑔 = 𝐺 → (⟨𝑔, ℎ⟩ ∈ RingOps ↔ ⟨𝐺, ℎ⟩ ∈ RingOps))
18		rneq 5926	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
19		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺))
20	19	sneqd 4601	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → {(GId‘𝑔)} = {(GId‘𝐺)})
21	18, 20	difeq12d 4082	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (ran 𝑔 ∖ {(GId‘𝑔)}) = (ran 𝐺 ∖ {(GId‘𝐺)}))
22	21	sqxpeqd 5693	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)})) = ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)})))
23	22	reseq2d 5978	. . . . . 6 ⊢ (𝑔 = 𝐺 → (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) = (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))))
24	23	eleq1d 2848	. . . . 5 ⊢ (𝑔 = 𝐺 → ((ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp ↔ (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp))
25	17, 24	anbi12d 643	. . . 4 ⊢ (𝑔 = 𝐺 → ((⟨𝑔, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝑔 ∖ {(GId‘𝑔)}) × (ran 𝑔 ∖ {(GId‘𝑔)}))) ∈ GrpOp) ↔ (⟨𝐺, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))
26		opeq2 4839	. . . . . 6 ⊢ (ℎ = 𝐻 → ⟨𝐺, ℎ⟩ = ⟨𝐺, 𝐻⟩)
27	26	eleq1d 2848	. . . . 5 ⊢ (ℎ = 𝐻 → (⟨𝐺, ℎ⟩ ∈ RingOps ↔ ⟨𝐺, 𝐻⟩ ∈ RingOps))
28		reseq1 5972	. . . . . 6 ⊢ (ℎ = 𝐻 → (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) = (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))))
29	28	eleq1d 2848	. . . . 5 ⊢ (ℎ = 𝐻 → ((ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp ↔ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp))
30	27, 29	anbi12d 643	. . . 4 ⊢ (ℎ = 𝐻 → ((⟨𝐺, ℎ⟩ ∈ RingOps ∧ (ℎ ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp) ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))
31	25, 30	opelopabg 5523	. . 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 813	1 ⊢ (𝐻 ∈ 𝐴 → (⟨𝐺, 𝐻⟩ ∈ DivRingOps ↔ (⟨𝐺, 𝐻⟩ ∈ RingOps ∧ (𝐻 ↾ ((ran 𝐺 ∖ {(GId‘𝐺)}) × (ran 𝐺 ∖ {(GId‘𝐺)}))) ∈ GrpOp)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ∖ cdif 3902  {csn 4589  ⟨cop 4595   class class class wbr 5109  {copab 5173   × cxp 5659  ran crn 5662   ↾ cres 5663  ‘cfv 6536  GrpOpcgr 30841  GIdcgi 30842  AbelOpcablo 30896  RingOpscrngo 38545  DivRingOpscdrng 38599

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-1st 7982  df-2nd 7983  df-rngo 38546  df-drngo 38600

This theorem is referenced by:  zrdivrng  38604  isdrngo1  38607