grpodivdiv - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > grpodivdiv		Structured version Visualization version GIF version

Theorem grpodivdiv 31199

Description: Double group division. (Contributed by NM, 24-Feb-2008.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
grpdivf.1	⊢ 𝑋 = ran 𝐺
grpdivf.3	⊢ 𝐷 = ( /_𝑔 ‘𝐺)

**Assertion**
Ref	Expression
grpodivdiv	⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷(𝐵𝐷𝐶)) = (𝐴𝐺(𝐶𝐷𝐵)))

**Proof of Theorem grpodivdiv**
Step	Hyp	Ref	Expression
1		simpl 488	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐺 ∈ GrpOp)
2		simpr1 1213	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
3		grpdivf.1	. . . . 5 ⊢ 𝑋 = ran 𝐺
4		grpdivf.3	. . . . 5 ⊢ 𝐷 = ( /_𝑔 ‘𝐺)
5	3, 4	grpodivcl 31198	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐷𝐶) ∈ 𝑋)
6	5	3adant3r1 1201	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐷𝐶) ∈ 𝑋)
7		eqid 2763	. . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺)
8	3, 7, 4	grpodivval 31194	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ (𝐵𝐷𝐶) ∈ 𝑋) → (𝐴𝐷(𝐵𝐷𝐶)) = (𝐴𝐺((inv‘𝐺)‘(𝐵𝐷𝐶))))
9	1, 2, 6, 8	syl3anc 1399	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷(𝐵𝐷𝐶)) = (𝐴𝐺((inv‘𝐺)‘(𝐵𝐷𝐶))))
10	3, 7, 4	grpoinvdiv 31196	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((inv‘𝐺)‘(𝐵𝐷𝐶)) = (𝐶𝐷𝐵))
11	10	3adant3r1 1201	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((inv‘𝐺)‘(𝐵𝐷𝐶)) = (𝐶𝐷𝐵))
12	11	oveq2d 7467	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐺((inv‘𝐺)‘(𝐵𝐷𝐶))) = (𝐴𝐺(𝐶𝐷𝐵)))
13	9, 12	eqtrd 2798	1 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷(𝐵𝐷𝐶)) = (𝐴𝐺(𝐶𝐷𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ran crn 5659 ‘cfv 6566 (class class class)co 7451 GrpOpcgr 31148 invcgn 31150 /_𝑔 cgs 31151

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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 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-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 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-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-grpo 31152 df-gid 31153 df-ginv 31154 df-gdiv 31155

This theorem is used by: ablodivdiv 31212

W3C validator