Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elghomlem1OLD Structured version   Visualization version   GIF version

Theorem elghomlem1OLD 38956
Description: Obsolete as of 15-Mar-2020. Lemma for elghomOLD 38958. (Contributed by Paul Chapman, 25-Feb-2008.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
elghomlem1OLD.1 𝑆 = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)𝐻(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))}
Assertion
Ref Expression
elghomlem1OLD ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐺 GrpOpHom 𝐻) = 𝑆)
Distinct variable groups:   𝑥,𝑓,𝑦,𝐺   𝑓,𝐻,𝑥,𝑦
Allowed substitution hints:   𝑆(𝑥, 𝑦, 𝑓)

Proof of Theorem elghomlem1OLD
Dummy variables 𝑔 ℎ are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rnexg 7918 . . 3 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
2 rnexg 7918 . . 3 (𝐻 ∈ GrpOp → ran 𝐻 ∈ V)
3 elghomlem1OLD.1 . . . 4 𝑆 = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)𝐻(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))}
43fabexg 7954 . . 3 ((ran 𝐺 ∈ V ∧ ran 𝐻 ∈ V) → 𝑆 ∈ V)
51, 2, 4syl2an 608 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → 𝑆 ∈ V)
6 rneq 5919 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
76feq2d 6698 . . . . 5 (𝑔 = 𝐺 → (𝑓:ran 𝑔⟶ran ℎ ↔ 𝑓:ran 𝐺⟶ran ℎ))
8 oveq 7430 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
98fveq2d 6894 . . . . . . . 8 (𝑔 = 𝐺 → (𝑓‘(𝑥𝑔𝑦)) = (𝑓‘(𝑥𝐺𝑦)))
109eqeq2d 2771 . . . . . . 7 (𝑔 = 𝐺 → (((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
116, 10raleqbidv 3334 . . . . . 6 (𝑔 = 𝐺 → (∀𝑦 ∈ ran 𝑔((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
126, 11raleqbidv 3334 . . . . 5 (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔∀𝑦 ∈ ran 𝑔((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
137, 12anbi12d 644 . . . 4 (𝑔 = 𝐺 → ((𝑓:ran 𝑔⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝑔∀𝑦 ∈ ran 𝑔((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝑔𝑦))) ↔ (𝑓:ran 𝐺⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))))
1413abbidv 2826 . . 3 (𝑔 = 𝐺 → {𝑓 ∣ (𝑓:ran 𝑔⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝑔∀𝑦 ∈ ran 𝑔((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝑔𝑦)))} = {𝑓 ∣ (𝑓:ran 𝐺⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))})
15 rneq 5919 . . . . . . 7 (ℎ = 𝐻 → ran ℎ = ran 𝐻)
1615feq3d 6699 . . . . . 6 (ℎ = 𝐻 → (𝑓:ran 𝐺⟶ran ℎ ↔ 𝑓:ran 𝐺⟶ran 𝐻))
17 oveq 7430 . . . . . . . 8 (ℎ = 𝐻 → ((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = ((𝑓‘𝑥)𝐻(𝑓‘𝑦)))
1817eqeq1d 2762 . . . . . . 7 (ℎ = 𝐻 → (((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ((𝑓‘𝑥)𝐻(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
19182ralbidv 3226 . . . . . 6 (ℎ = 𝐻 → (∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)𝐻(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
2016, 19anbi12d 644 . . . . 5 (ℎ = 𝐻 → ((𝑓:ran 𝐺⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦))) ↔ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)𝐻(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))))
2120abbidv 2826 . . . 4 (ℎ = 𝐻 → {𝑓 ∣ (𝑓:ran 𝐺⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))} = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)𝐻(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))})
2221, 3eqtr4di 2813 . . 3 (ℎ = 𝐻 → {𝑓 ∣ (𝑓:ran 𝐺⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝐺∀𝑦 ∈ ran 𝐺((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝐺𝑦)))} = 𝑆)
23 df-ghomOLD 38955 . . 3 GrpOpHom = (𝑔 ∈ GrpOp, ℎ ∈ GrpOp ↦ {𝑓 ∣ (𝑓:ran 𝑔⟶ran ℎ ∧ ∀𝑥 ∈ ran 𝑔∀𝑦 ∈ ran 𝑔((𝑓‘𝑥)ℎ(𝑓‘𝑦)) = (𝑓‘(𝑥𝑔𝑦)))})
2414, 22, 23ovmpog 7583 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝑆 ∈ V) → (𝐺 GrpOpHom 𝐻) = 𝑆)
255, 24mpd3an3 1491 1 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐺 GrpOpHom 𝐻) = 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  Vcvv 3450  ran crn 5652  ⟶wf 6539  ‘cfv 6543  (class class class)co 7424  GrpOpcgr 31100   GrpOpHom cghomOLD 38954
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-ghomOLD 38955
This theorem is used by:  elghomlem2OLD  38957
  Copyright terms: Public domain W3C validator