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

Theorem gidval 31001
Description: The value of the identity element of a group. (Contributed by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)
Hypothesis
Ref Expression
gidval.1 𝑋 = ran 𝐺
Assertion
Ref Expression
gidval (𝐺𝑉 → (GId‘𝐺) = (𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
Distinct variable groups:   𝑥,𝑢,𝐺   𝑢,𝑋,𝑥
Allowed substitution hints:   𝑉(𝑥, 𝑢)

Proof of Theorem gidval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 elex 3474 . 2 (𝐺𝑉𝐺 ∈ V)
2 rneq 5924 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
3 gidval.1 . . . . 5 𝑋 = ran 𝐺
42, 3eqtr4di 2815 . . . 4 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
5 oveq 7423 . . . . . . 7 (𝑔 = 𝐺 → (𝑢𝑔𝑥) = (𝑢𝐺𝑥))
65eqeq1d 2764 . . . . . 6 (𝑔 = 𝐺 → ((𝑢𝑔𝑥) = 𝑥 ↔ (𝑢𝐺𝑥) = 𝑥))
7 oveq 7423 . . . . . . 7 (𝑔 = 𝐺 → (𝑥𝑔𝑢) = (𝑥𝐺𝑢))
87eqeq1d 2764 . . . . . 6 (𝑔 = 𝐺 → ((𝑥𝑔𝑢) = 𝑥 ↔ (𝑥𝐺𝑢) = 𝑥))
96, 8anbi12d 644 . . . . 5 (𝑔 = 𝐺 → (((𝑢𝑔𝑥) = 𝑥 ∧ (𝑥𝑔𝑢) = 𝑥) ↔ ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
104, 9raleqbidv 3336 . . . 4 (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔((𝑢𝑔𝑥) = 𝑥 ∧ (𝑥𝑔𝑢) = 𝑥) ↔ ∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
114, 10riotaeqbidv 7377 . . 3 (𝑔 = 𝐺 → (𝑢 ∈ ran 𝑔𝑥 ∈ ran 𝑔((𝑢𝑔𝑥) = 𝑥 ∧ (𝑥𝑔𝑢) = 𝑥)) = (𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
12 df-gid 30983 . . 3 GId = (𝑔 ∈ V ↦ (𝑢 ∈ ran 𝑔𝑥 ∈ ran 𝑔((𝑢𝑔𝑥) = 𝑥 ∧ (𝑥𝑔𝑢) = 𝑥)))
13 riotaex 7378 . . 3 (𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) ∈ V
1411, 12, 13fvmpt 6990 . 2 (𝐺 ∈ V → (GId‘𝐺) = (𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
151, 14syl 18 1 (𝐺𝑉 → (GId‘𝐺) = (𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3078  Vcvv 3453  ran crn 5660  cfv 6537  crio 7373  (class class class)co 7417  GIdcgi 30979
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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fv 6545  df-riota 7374  df-ov 7420  df-gid 30983
This theorem is used by:  grpoidval  31002  idrval  38615  exidresid  38637
  Copyright terms: Public domain W3C validator