Theorem grpoinvf 30561

Description: Mapping of the inverse function of a group. (Contributed by NM, 29-Mar-2008.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
grpasscan1.1	⊢ 𝑋 = ran 𝐺
grpasscan1.2	⊢ 𝑁 = (inv‘𝐺)

Assertion

Ref	Expression
grpoinvf	⊢ (𝐺 ∈ GrpOp → 𝑁:𝑋–1-1-onto→𝑋)

Proof of Theorem grpoinvf

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

Step	Hyp	Ref	Expression
1		riotaex 7392	. . . 4 ⊢ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = (GId‘𝐺)) ∈ V
2		eqid 2735	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = (GId‘𝐺)))
3	1, 2	fnmpti 6712	. . 3 ⊢ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))) Fn 𝑋
4		grpasscan1.1	. . . . 5 ⊢ 𝑋 = ran 𝐺
5		eqid 2735	. . . . 5 ⊢ (GId‘𝐺) = (GId‘𝐺)
6		grpasscan1.2	. . . . 5 ⊢ 𝑁 = (inv‘𝐺)
7	4, 5, 6	grpoinvfval 30551	. . . 4 ⊢ (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))))
8	7	fneq1d 6662	. . 3 ⊢ (𝐺 ∈ GrpOp → (𝑁 Fn 𝑋 ↔ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))) Fn 𝑋))
9	3, 8	mpbiri 258	. 2 ⊢ (𝐺 ∈ GrpOp → 𝑁 Fn 𝑋)
10		fnrnfv 6968	. . . 4 ⊢ (𝑁 Fn 𝑋 → ran 𝑁 = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥)})
11	9, 10	syl 17	. . 3 ⊢ (𝐺 ∈ GrpOp → ran 𝑁 = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥)})
12	4, 6	grpoinvcl 30553	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑦 ∈ 𝑋) → (𝑁‘𝑦) ∈ 𝑋)
13	4, 6	grpo2inv 30560	. . . . . . . 8 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑦 ∈ 𝑋) → (𝑁‘(𝑁‘𝑦)) = 𝑦)
14	13	eqcomd 2741	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑦 ∈ 𝑋) → 𝑦 = (𝑁‘(𝑁‘𝑦)))
15		fveq2 6907	. . . . . . . 8 ⊢ (𝑥 = (𝑁‘𝑦) → (𝑁‘𝑥) = (𝑁‘(𝑁‘𝑦)))
16	15	rspceeqv 3645	. . . . . . 7 ⊢ (((𝑁‘𝑦) ∈ 𝑋 ∧ 𝑦 = (𝑁‘(𝑁‘𝑦))) → ∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥))
17	12, 14, 16	syl2anc 584	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑦 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥))
18	17	ex 412	. . . . 5 ⊢ (𝐺 ∈ GrpOp → (𝑦 ∈ 𝑋 → ∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥)))
19		simpr 484	. . . . . . 7 ⊢ (((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 = (𝑁‘𝑥)) → 𝑦 = (𝑁‘𝑥))
20	4, 6	grpoinvcl 30553	. . . . . . . 8 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) → (𝑁‘𝑥) ∈ 𝑋)
21	20	adantr 480	. . . . . . 7 ⊢ (((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 = (𝑁‘𝑥)) → (𝑁‘𝑥) ∈ 𝑋)
22	19, 21	eqeltrd 2839	. . . . . 6 ⊢ (((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 = (𝑁‘𝑥)) → 𝑦 ∈ 𝑋)
23	22	rexlimdva2 3155	. . . . 5 ⊢ (𝐺 ∈ GrpOp → (∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥) → 𝑦 ∈ 𝑋))
24	18, 23	impbid 212	. . . 4 ⊢ (𝐺 ∈ GrpOp → (𝑦 ∈ 𝑋 ↔ ∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥)))
25	24	eqabdv 2873	. . 3 ⊢ (𝐺 ∈ GrpOp → 𝑋 = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 = (𝑁‘𝑥)})
26	11, 25	eqtr4d 2778	. 2 ⊢ (𝐺 ∈ GrpOp → ran 𝑁 = 𝑋)
27		fveq2 6907	. . . 4 ⊢ ((𝑁‘𝑥) = (𝑁‘𝑦) → (𝑁‘(𝑁‘𝑥)) = (𝑁‘(𝑁‘𝑦)))
28	4, 6	grpo2inv 30560	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) → (𝑁‘(𝑁‘𝑥)) = 𝑥)
29	28, 13	eqeqan12d 2749	. . . . 5 ⊢ (((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋) ∧ (𝐺 ∈ GrpOp ∧ 𝑦 ∈ 𝑋)) → ((𝑁‘(𝑁‘𝑥)) = (𝑁‘(𝑁‘𝑦)) ↔ 𝑥 = 𝑦))
30	29	anandis 678	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑁‘(𝑁‘𝑥)) = (𝑁‘(𝑁‘𝑦)) ↔ 𝑥 = 𝑦))
31	27, 30	imbitrid 244	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑁‘𝑥) = (𝑁‘𝑦) → 𝑥 = 𝑦))
32	31	ralrimivva 3200	. 2 ⊢ (𝐺 ∈ GrpOp → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑁‘𝑥) = (𝑁‘𝑦) → 𝑥 = 𝑦))
33		dff1o6 7295	. 2 ⊢ (𝑁:𝑋–1-1-onto→𝑋 ↔ (𝑁 Fn 𝑋 ∧ ran 𝑁 = 𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑁‘𝑥) = (𝑁‘𝑦) → 𝑥 = 𝑦)))
34	9, 26, 32, 33	syl3anbrc 1342	1 ⊢ (𝐺 ∈ GrpOp → 𝑁:𝑋–1-1-onto→𝑋)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  {cab 2712  ∀wral 3059  ∃wrex 3068   ↦ cmpt 5231  ran crn 5690   Fn wfn 6558  –1-1-onto→wf1o 6562  ‘cfv 6563  ℩crio 7387  (class class class)co 7431  GrpOpcgr 30518  GIdcgi 30519  invcgn 30520

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-grpo 30522  df-gid 30523  df-ginv 30524

This theorem is referenced by:  nvinvfval  30669