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 35970
Description: Obsolete as of 15-Mar-2020. Lemma for elghomOLD 35972. (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 7725 . . 3 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
2 rnexg 7725 . . 3 (𝐻 ∈ GrpOp → ran 𝐻 ∈ V)
3 elghomlem1OLD.1 . . . 4 𝑆 = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))}
43fabexg 7755 . . 3 ((ran 𝐺 ∈ V ∧ ran 𝐻 ∈ V) → 𝑆 ∈ V)
51, 2, 4syl2an 595 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → 𝑆 ∈ V)
6 rneq 5834 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
76feq2d 6570 . . . . 5 (𝑔 = 𝐺 → (𝑓:ran 𝑔⟶ran 𝑓:ran 𝐺⟶ran ))
8 oveq 7261 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
98fveq2d 6760 . . . . . . . 8 (𝑔 = 𝐺 → (𝑓‘(𝑥𝑔𝑦)) = (𝑓‘(𝑥𝐺𝑦)))
109eqeq2d 2749 . . . . . . 7 (𝑔 = 𝐺 → (((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
116, 10raleqbidv 3327 . . . . . 6 (𝑔 = 𝐺 → (∀𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ∀𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
126, 11raleqbidv 3327 . . . . 5 (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
137, 12anbi12d 630 . . . 4 (𝑔 = 𝐺 → ((𝑓:ran 𝑔⟶ran ∧ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦))) ↔ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))))
1413abbidv 2808 . . 3 (𝑔 = 𝐺 → {𝑓 ∣ (𝑓:ran 𝑔⟶ran ∧ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)))} = {𝑓 ∣ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))})
15 rneq 5834 . . . . . . 7 ( = 𝐻 → ran = ran 𝐻)
1615feq3d 6571 . . . . . 6 ( = 𝐻 → (𝑓:ran 𝐺⟶ran 𝑓:ran 𝐺⟶ran 𝐻))
17 oveq 7261 . . . . . . . 8 ( = 𝐻 → ((𝑓𝑥)(𝑓𝑦)) = ((𝑓𝑥)𝐻(𝑓𝑦)))
1817eqeq1d 2740 . . . . . . 7 ( = 𝐻 → (((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
19182ralbidv 3122 . . . . . 6 ( = 𝐻 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
2016, 19anbi12d 630 . . . . 5 ( = 𝐻 → ((𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))) ↔ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))))
2120abbidv 2808 . . . 4 ( = 𝐻 → {𝑓 ∣ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))} = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))})
2221, 3eqtr4di 2797 . . 3 ( = 𝐻 → {𝑓 ∣ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))} = 𝑆)
23 df-ghomOLD 35969 . . 3 GrpOpHom = (𝑔 ∈ GrpOp, ∈ GrpOp ↦ {𝑓 ∣ (𝑓:ran 𝑔⟶ran ∧ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)))})
2414, 22, 23ovmpog 7410 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝑆 ∈ V) → (𝐺 GrpOpHom 𝐻) = 𝑆)
255, 24mpd3an3 1460 1 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐺 GrpOpHom 𝐻) = 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  {cab 2715  wral 3063  Vcvv 3422  ran crn 5581  wf 6414  cfv 6418  (class class class)co 7255  GrpOpcgr 28752   GrpOpHom cghomOLD 35968
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-ghomOLD 35969
This theorem is referenced by:  elghomlem2OLD  35971
  Copyright terms: Public domain W3C validator