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 36417
Description: Obsolete as of 15-Mar-2020. Lemma for elghomOLD 36419. (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 7846 . . 3 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
2 rnexg 7846 . . 3 (𝐻 ∈ GrpOp → ran 𝐻 ∈ V)
3 elghomlem1OLD.1 . . . 4 𝑆 = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))}
43fabexg 7876 . . 3 ((ran 𝐺 ∈ V ∧ ran 𝐻 ∈ V) → 𝑆 ∈ V)
51, 2, 4syl2an 596 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → 𝑆 ∈ V)
6 rneq 5896 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
76feq2d 6659 . . . . 5 (𝑔 = 𝐺 → (𝑓:ran 𝑔⟶ran 𝑓:ran 𝐺⟶ran ))
8 oveq 7368 . . . . . . . . 9 (𝑔 = 𝐺 → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
98fveq2d 6851 . . . . . . . 8 (𝑔 = 𝐺 → (𝑓‘(𝑥𝑔𝑦)) = (𝑓‘(𝑥𝐺𝑦)))
109eqeq2d 2742 . . . . . . 7 (𝑔 = 𝐺 → (((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
116, 10raleqbidv 3317 . . . . . 6 (𝑔 = 𝐺 → (∀𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ∀𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
126, 11raleqbidv 3317 . . . . 5 (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
137, 12anbi12d 631 . . . 4 (𝑔 = 𝐺 → ((𝑓:ran 𝑔⟶ran ∧ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦))) ↔ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))))
1413abbidv 2800 . . 3 (𝑔 = 𝐺 → {𝑓 ∣ (𝑓:ran 𝑔⟶ran ∧ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)))} = {𝑓 ∣ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))})
15 rneq 5896 . . . . . . 7 ( = 𝐻 → ran = ran 𝐻)
1615feq3d 6660 . . . . . 6 ( = 𝐻 → (𝑓:ran 𝐺⟶ran 𝑓:ran 𝐺⟶ran 𝐻))
17 oveq 7368 . . . . . . . 8 ( = 𝐻 → ((𝑓𝑥)(𝑓𝑦)) = ((𝑓𝑥)𝐻(𝑓𝑦)))
1817eqeq1d 2733 . . . . . . 7 ( = 𝐻 → (((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
19182ralbidv 3208 . . . . . 6 ( = 𝐻 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))))
2016, 19anbi12d 631 . . . . 5 ( = 𝐻 → ((𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))) ↔ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))))
2120abbidv 2800 . . . 4 ( = 𝐻 → {𝑓 ∣ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))} = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))})
2221, 3eqtr4di 2789 . . 3 ( = 𝐻 → {𝑓 ∣ (𝑓:ran 𝐺⟶ran ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))} = 𝑆)
23 df-ghomOLD 36416 . . 3 GrpOpHom = (𝑔 ∈ GrpOp, ∈ GrpOp ↦ {𝑓 ∣ (𝑓:ran 𝑔⟶ran ∧ ∀𝑥 ∈ ran 𝑔𝑦 ∈ ran 𝑔((𝑓𝑥)(𝑓𝑦)) = (𝑓‘(𝑥𝑔𝑦)))})
2414, 22, 23ovmpog 7519 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝑆 ∈ V) → (𝐺 GrpOpHom 𝐻) = 𝑆)
255, 24mpd3an3 1462 1 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐺 GrpOpHom 𝐻) = 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  {cab 2708  wral 3060  Vcvv 3446  ran crn 5639  wf 6497  cfv 6501  (class class class)co 7362  GrpOpcgr 29494   GrpOpHom cghomOLD 36415
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-sbc 3743  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-id 5536  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-fv 6509  df-ov 7365  df-oprab 7366  df-mpo 7367  df-ghomOLD 36416
This theorem is referenced by:  elghomlem2OLD  36418
  Copyright terms: Public domain W3C validator