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

Theorem elghomOLD 38638
Description: Obsolete version of isghm 19344 as of 15-Mar-2020. Membership in the set of group homomorphisms from 𝐺 to 𝐻. (Contributed by Paul Chapman, 3-Mar-2008.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
elghomOLD.1 𝑋 = ran 𝐺
elghomOLD.2 𝑊 = ran 𝐻
Assertion
Ref Expression
elghomOLD ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ (𝐹:𝑋𝑊 ∧ ∀𝑥𝑋𝑦𝑋 ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝑊(𝑥, 𝑦)

Proof of Theorem elghomOLD
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . 3 {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))} = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))}
21elghomlem2OLD 38637 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
3 elghomOLD.1 . . . 4 𝑋 = ran 𝐺
4 elghomOLD.2 . . . 4 𝑊 = ran 𝐻
53, 4feq23i 6697 . . 3 (𝐹:𝑋𝑊𝐹:ran 𝐺⟶ran 𝐻)
63raleqi 3317 . . . 4 (∀𝑦𝑋 ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)) ↔ ∀𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))
73, 6raleqbii 3332 . . 3 (∀𝑥𝑋𝑦𝑋 ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))
85, 7anbi12i 640 . 2 ((𝐹:𝑋𝑊 ∧ ∀𝑥𝑋𝑦𝑋 ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
92, 8bitr4di 292 1 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ (𝐹:𝑋𝑊 ∧ ∀𝑥𝑋𝑦𝑋 ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  {cab 2738  wral 3076  ran crn 5656  wf 6529  cfv 6533  (class class class)co 7414  GrpOpcgr 30971   GrpOpHom cghomOLD 38634
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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  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-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-ghomOLD 38635
This theorem is used by:  ghomlinOLD  38639  ghomidOLD  38640  ghomf  38641  ghomco  38642  rngogrphom  38722
  Copyright terms: Public domain W3C validator