Theorem grpodivf 30510

Description: Mapping for group division. (Contributed by NM, 10-Apr-2008.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
grpodivf	⊢ (𝐺 ∈ GrpOp → 𝐷:(𝑋 × 𝑋)⟶𝑋)

Proof of Theorem grpodivf

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

Step	Hyp	Ref	Expression
1		grpdivf.1	. . . . . . . 8 ⊢ 𝑋 = ran 𝐺
2		eqid 2731	. . . . . . . 8 ⊢ (inv‘𝐺) = (inv‘𝐺)
3	1, 2	grpoinvcl 30496	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑦 ∈ 𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
4	3	3adant2 1131	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → ((inv‘𝐺)‘𝑦) ∈ 𝑋)
5	1	grpocl 30472	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝑦) ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
6	4, 5	syld3an3 1411	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
7	6	3expib 1122	. . . 4 ⊢ (𝐺 ∈ GrpOp → ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋))
8	7	ralrimivv 3173	. . 3 ⊢ (𝐺 ∈ GrpOp → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋)
9		eqid 2731	. . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦)))
10	9	fmpo 7995	. . 3 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝐺((inv‘𝐺)‘𝑦)) ∈ 𝑋 ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
11	8, 10	sylib 218	. 2 ⊢ (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋)
12		grpdivf.3	. . . 4 ⊢ 𝐷 = ( /𝑔 ‘𝐺)
13	1, 2, 12	grpodivfval 30506	. . 3 ⊢ (𝐺 ∈ GrpOp → 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))))
14	13	feq1d 6628	. 2 ⊢ (𝐺 ∈ GrpOp → (𝐷:(𝑋 × 𝑋)⟶𝑋 ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (𝑥𝐺((inv‘𝐺)‘𝑦))):(𝑋 × 𝑋)⟶𝑋))
15	11, 14	mpbird 257	1 ⊢ (𝐺 ∈ GrpOp → 𝐷:(𝑋 × 𝑋)⟶𝑋)

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2111  ∀wral 3047   × cxp 5609  ran crn 5612  ⟶wf 6472  ‘cfv 6476  (class class class)co 7341   ∈ cmpo 7343  GrpOpcgr 30461  invcgn 30463   /_𝑔 cgs 30464

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5212  ax-sep 5229  ax-nul 5239  ax-pow 5298  ax-pr 5365  ax-un 7663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-iun 4938  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5506  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-1st 7916  df-2nd 7917  df-grpo 30465  df-gid 30466  df-ginv 30467  df-gdiv 30468

This theorem is referenced by:  grpodivcl  30511