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

Theorem grpraddf1o 19217
Description: Right addition by a group element is a bijection on any group. (Contributed by SN, 28-Apr-2012.)
Hypotheses
Ref Expression
grpraddf1o.b 𝐵 = (Base‘𝐺)
grpraddf1o.p + = (+g‘𝐺)
grpraddf1o.n 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 + 𝑋))
Assertion
Ref Expression
grpraddf1o ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐹:𝐵–1-1-onto→𝐵)
Distinct variable groups:   𝑥,𝐵   𝑥,𝐺   𝑥, +   𝑥,𝑋
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem grpraddf1o
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 grpraddf1o.n . 2 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 + 𝑋))
2 grpraddf1o.b . . 3 𝐵 = (Base‘𝐺)
3 grpraddf1o.p . . 3 + = (+g‘𝐺)
4 simpll 779 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝐺 ∈ Grp)
5 simpr 490 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
6 simplr 781 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐵)
72, 3, 4, 5, 6grpcld 19151 . 2 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 + 𝑋) ∈ 𝐵)
8 simpll 779 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝐺 ∈ Grp)
9 simpr 490 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
10 eqid 2761 . . . 4 (invg‘𝐺) = (invg‘𝐺)
11 simplr 781 . . . 4 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑋 ∈ 𝐵)
122, 10, 8, 11grpinvcld 19192 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((invg‘𝐺)‘𝑋) ∈ 𝐵)
132, 3, 8, 9, 12grpcld 19151 . 2 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑦 + ((invg‘𝐺)‘𝑋)) ∈ 𝐵)
14 eqcom 2768 . . 3 (𝑥 = (𝑦 + ((invg‘𝐺)‘𝑋)) ↔ (𝑦 + ((invg‘𝐺)‘𝑋)) = 𝑥)
15 simpll 779 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐺 ∈ Grp)
1613adantrl 729 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑦 + ((invg‘𝐺)‘𝑋)) ∈ 𝐵)
17 simprl 783 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
18 simplr 781 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
192, 3grprcan 19177 . . . . 5 ((𝐺 ∈ Grp ∧ ((𝑦 + ((invg‘𝐺)‘𝑋)) ∈ 𝐵 ∧ 𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (((𝑦 + ((invg‘𝐺)‘𝑋)) + 𝑋) = (𝑥 + 𝑋) ↔ (𝑦 + ((invg‘𝐺)‘𝑋)) = 𝑥))
2015, 16, 17, 18, 19syl13anc 1399 . . . 4 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((𝑦 + ((invg‘𝐺)‘𝑋)) + 𝑋) = (𝑥 + 𝑋) ↔ (𝑦 + ((invg‘𝐺)‘𝑋)) = 𝑥))
21 simprr 785 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
2212adantrl 729 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((invg‘𝐺)‘𝑋) ∈ 𝐵)
232, 3, 15, 21, 22, 18grpassd 19149 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑦 + ((invg‘𝐺)‘𝑋)) + 𝑋) = (𝑦 + (((invg‘𝐺)‘𝑋) + 𝑋)))
24 eqid 2761 . . . . . . . . 9 (0g‘𝐺) = (0g‘𝐺)
252, 3, 24, 10grplinv 19193 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((invg‘𝐺)‘𝑋) + 𝑋) = (0g‘𝐺))
2625adantr 486 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((invg‘𝐺)‘𝑋) + 𝑋) = (0g‘𝐺))
2726oveq2d 7434 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑦 + (((invg‘𝐺)‘𝑋) + 𝑋)) = (𝑦 + (0g‘𝐺)))
282, 3, 24grprid 19172 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵) → (𝑦 + (0g‘𝐺)) = 𝑦)
2928ad2ant2rl 762 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑦 + (0g‘𝐺)) = 𝑦)
3023, 27, 293eqtrd 2800 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑦 + ((invg‘𝐺)‘𝑋)) + 𝑋) = 𝑦)
3130eqeq1d 2763 . . . 4 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((𝑦 + ((invg‘𝐺)‘𝑋)) + 𝑋) = (𝑥 + 𝑋) ↔ 𝑦 = (𝑥 + 𝑋)))
3220, 31bitr3d 284 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑦 + ((invg‘𝐺)‘𝑋)) = 𝑥 ↔ 𝑦 = (𝑥 + 𝑋)))
3314, 32bitrid 286 . 2 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 = (𝑦 + ((invg‘𝐺)‘𝑋)) ↔ 𝑦 = (𝑥 + 𝑋)))
341, 7, 13, 33f1o2d 7673 1 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐹:𝐵–1-1-onto→𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5186  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +gcplusg 17421  0gc0g 17603  Grpcgrp 19137  invgcminusg 19138
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-0g 17605  df-mgm 18809  df-sgrp 18901  df-mnd 18917  df-grp 19140  df-minusg 19141
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator