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

Theorem elghomlem2OLD 37868
Description: Obsolete as of 15-Mar-2020. Lemma for elghomOLD 37869. (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
elghomlem2OLD ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
Distinct variable groups:   𝑥,𝑓,𝑦,𝐹   𝑓,𝐺,𝑥,𝑦   𝑓,𝐻,𝑥,𝑦
Allowed substitution hints:   𝑆(𝑥,𝑦,𝑓)

Proof of Theorem elghomlem2OLD
StepHypRef Expression
1 elghomlem1OLD.1 . . . 4 𝑆 = {𝑓 ∣ (𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)))}
21elghomlem1OLD 37867 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐺 GrpOpHom 𝐻) = 𝑆)
32eleq2d 2814 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ 𝐹𝑆))
4 elex 3459 . . . . 5 (𝐹𝑆𝐹 ∈ V)
5 feq1 6634 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓:ran 𝐺⟶ran 𝐻𝐹:ran 𝐺⟶ran 𝐻))
6 fveq1 6825 . . . . . . . . . . 11 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
7 fveq1 6825 . . . . . . . . . . 11 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
86, 7oveq12d 7371 . . . . . . . . . 10 (𝑓 = 𝐹 → ((𝑓𝑥)𝐻(𝑓𝑦)) = ((𝐹𝑥)𝐻(𝐹𝑦)))
9 fveq1 6825 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑓‘(𝑥𝐺𝑦)) = (𝐹‘(𝑥𝐺𝑦)))
108, 9eqeq12d 2745 . . . . . . . . 9 (𝑓 = 𝐹 → (((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
11102ralbidv 3193 . . . . . . . 8 (𝑓 = 𝐹 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
125, 11anbi12d 632 . . . . . . 7 (𝑓 = 𝐹 → ((𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
1312, 1elab2g 3638 . . . . . 6 (𝐹 ∈ V → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
1413biimpd 229 . . . . 5 (𝐹 ∈ V → (𝐹𝑆 → (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
154, 14mpcom 38 . . . 4 (𝐹𝑆 → (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
16 rnexg 7842 . . . . . . 7 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
17 fex 7166 . . . . . . . 8 ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ran 𝐺 ∈ V) → 𝐹 ∈ V)
1817expcom 413 . . . . . . 7 (ran 𝐺 ∈ V → (𝐹:ran 𝐺⟶ran 𝐻𝐹 ∈ V))
1916, 18syl 17 . . . . . 6 (𝐺 ∈ GrpOp → (𝐹:ran 𝐺⟶ran 𝐻𝐹 ∈ V))
2019adantrd 491 . . . . 5 (𝐺 ∈ GrpOp → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹 ∈ V))
2113biimprd 248 . . . . 5 (𝐹 ∈ V → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹𝑆))
2220, 21syli 39 . . . 4 (𝐺 ∈ GrpOp → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹𝑆))
2315, 22impbid2 226 . . 3 (𝐺 ∈ GrpOp → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
2423adantr 480 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
253, 24bitrd 279 1 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  {cab 2707  wral 3044  Vcvv 3438  ran crn 5624  wf 6482  cfv 6486  (class class class)co 7353  GrpOpcgr 30451   GrpOpHom cghomOLD 37865
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-ghomOLD 37866
This theorem is referenced by:  elghomOLD  37869
  Copyright terms: Public domain W3C validator