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

Theorem grpoinvf 30564
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.
StepHypRef Expression
1 riotaex 7408 . . . 4 (𝑦𝑋 (𝑦𝐺𝑥) = (GId‘𝐺)) ∈ V
2 eqid 2740 . . . 4 (𝑥𝑋 ↦ (𝑦𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))) = (𝑥𝑋 ↦ (𝑦𝑋 (𝑦𝐺𝑥) = (GId‘𝐺)))
31, 2fnmpti 6723 . . 3 (𝑥𝑋 ↦ (𝑦𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))) Fn 𝑋
4 grpasscan1.1 . . . . 5 𝑋 = ran 𝐺
5 eqid 2740 . . . . 5 (GId‘𝐺) = (GId‘𝐺)
6 grpasscan1.2 . . . . 5 𝑁 = (inv‘𝐺)
74, 5, 6grpoinvfval 30554 . . . 4 (𝐺 ∈ GrpOp → 𝑁 = (𝑥𝑋 ↦ (𝑦𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))))
87fneq1d 6672 . . 3 (𝐺 ∈ GrpOp → (𝑁 Fn 𝑋 ↔ (𝑥𝑋 ↦ (𝑦𝑋 (𝑦𝐺𝑥) = (GId‘𝐺))) Fn 𝑋))
93, 8mpbiri 258 . 2 (𝐺 ∈ GrpOp → 𝑁 Fn 𝑋)
10 fnrnfv 6981 . . . 4 (𝑁 Fn 𝑋 → ran 𝑁 = {𝑦 ∣ ∃𝑥𝑋 𝑦 = (𝑁𝑥)})
119, 10syl 17 . . 3 (𝐺 ∈ GrpOp → ran 𝑁 = {𝑦 ∣ ∃𝑥𝑋 𝑦 = (𝑁𝑥)})
124, 6grpoinvcl 30556 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝑦𝑋) → (𝑁𝑦) ∈ 𝑋)
134, 6grpo2inv 30563 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ 𝑦𝑋) → (𝑁‘(𝑁𝑦)) = 𝑦)
1413eqcomd 2746 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝑦𝑋) → 𝑦 = (𝑁‘(𝑁𝑦)))
15 fveq2 6920 . . . . . . . 8 (𝑥 = (𝑁𝑦) → (𝑁𝑥) = (𝑁‘(𝑁𝑦)))
1615rspceeqv 3658 . . . . . . 7 (((𝑁𝑦) ∈ 𝑋𝑦 = (𝑁‘(𝑁𝑦))) → ∃𝑥𝑋 𝑦 = (𝑁𝑥))
1712, 14, 16syl2anc 583 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑦𝑋) → ∃𝑥𝑋 𝑦 = (𝑁𝑥))
1817ex 412 . . . . 5 (𝐺 ∈ GrpOp → (𝑦𝑋 → ∃𝑥𝑋 𝑦 = (𝑁𝑥)))
19 simpr 484 . . . . . . 7 (((𝐺 ∈ GrpOp ∧ 𝑥𝑋) ∧ 𝑦 = (𝑁𝑥)) → 𝑦 = (𝑁𝑥))
204, 6grpoinvcl 30556 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋) → (𝑁𝑥) ∈ 𝑋)
2120adantr 480 . . . . . . 7 (((𝐺 ∈ GrpOp ∧ 𝑥𝑋) ∧ 𝑦 = (𝑁𝑥)) → (𝑁𝑥) ∈ 𝑋)
2219, 21eqeltrd 2844 . . . . . 6 (((𝐺 ∈ GrpOp ∧ 𝑥𝑋) ∧ 𝑦 = (𝑁𝑥)) → 𝑦𝑋)
2322rexlimdva2 3163 . . . . 5 (𝐺 ∈ GrpOp → (∃𝑥𝑋 𝑦 = (𝑁𝑥) → 𝑦𝑋))
2418, 23impbid 212 . . . 4 (𝐺 ∈ GrpOp → (𝑦𝑋 ↔ ∃𝑥𝑋 𝑦 = (𝑁𝑥)))
2524eqabdv 2878 . . 3 (𝐺 ∈ GrpOp → 𝑋 = {𝑦 ∣ ∃𝑥𝑋 𝑦 = (𝑁𝑥)})
2611, 25eqtr4d 2783 . 2 (𝐺 ∈ GrpOp → ran 𝑁 = 𝑋)
27 fveq2 6920 . . . 4 ((𝑁𝑥) = (𝑁𝑦) → (𝑁‘(𝑁𝑥)) = (𝑁‘(𝑁𝑦)))
284, 6grpo2inv 30563 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝑥𝑋) → (𝑁‘(𝑁𝑥)) = 𝑥)
2928, 13eqeqan12d 2754 . . . . 5 (((𝐺 ∈ GrpOp ∧ 𝑥𝑋) ∧ (𝐺 ∈ GrpOp ∧ 𝑦𝑋)) → ((𝑁‘(𝑁𝑥)) = (𝑁‘(𝑁𝑦)) ↔ 𝑥 = 𝑦))
3029anandis 677 . . . 4 ((𝐺 ∈ GrpOp ∧ (𝑥𝑋𝑦𝑋)) → ((𝑁‘(𝑁𝑥)) = (𝑁‘(𝑁𝑦)) ↔ 𝑥 = 𝑦))
3127, 30imbitrid 244 . . 3 ((𝐺 ∈ GrpOp ∧ (𝑥𝑋𝑦𝑋)) → ((𝑁𝑥) = (𝑁𝑦) → 𝑥 = 𝑦))
3231ralrimivva 3208 . 2 (𝐺 ∈ GrpOp → ∀𝑥𝑋𝑦𝑋 ((𝑁𝑥) = (𝑁𝑦) → 𝑥 = 𝑦))
33 dff1o6 7311 . 2 (𝑁:𝑋1-1-onto𝑋 ↔ (𝑁 Fn 𝑋 ∧ ran 𝑁 = 𝑋 ∧ ∀𝑥𝑋𝑦𝑋 ((𝑁𝑥) = (𝑁𝑦) → 𝑥 = 𝑦)))
349, 26, 32, 33syl3anbrc 1343 1 (𝐺 ∈ GrpOp → 𝑁:𝑋1-1-onto𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  {cab 2717  wral 3067  wrex 3076  cmpt 5249  ran crn 5701   Fn wfn 6568  1-1-ontowf1o 6572  cfv 6573  crio 7403  (class class class)co 7448  GrpOpcgr 30521  GIdcgi 30522  invcgn 30523
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-grpo 30525  df-gid 30526  df-ginv 30527
This theorem is referenced by:  nvinvfval  30672
  Copyright terms: Public domain W3C validator