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 35163
Description: Obsolete as of 15-Mar-2020. Lemma for elghomOLD 35164. (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 35162 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐺 GrpOpHom 𝐻) = 𝑆)
32eleq2d 2898 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ 𝐹𝑆))
4 elex 3512 . . . . 5 (𝐹𝑆𝐹 ∈ V)
5 feq1 6494 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓:ran 𝐺⟶ran 𝐻𝐹:ran 𝐺⟶ran 𝐻))
6 fveq1 6668 . . . . . . . . . . 11 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
7 fveq1 6668 . . . . . . . . . . 11 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
86, 7oveq12d 7173 . . . . . . . . . 10 (𝑓 = 𝐹 → ((𝑓𝑥)𝐻(𝑓𝑦)) = ((𝐹𝑥)𝐻(𝐹𝑦)))
9 fveq1 6668 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑓‘(𝑥𝐺𝑦)) = (𝐹‘(𝑥𝐺𝑦)))
108, 9eqeq12d 2837 . . . . . . . . 9 (𝑓 = 𝐹 → (((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
11102ralbidv 3199 . . . . . . . 8 (𝑓 = 𝐹 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
125, 11anbi12d 632 . . . . . . 7 (𝑓 = 𝐹 → ((𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
1312, 1elab2g 3667 . . . . . 6 (𝐹 ∈ V → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
1413biimpd 231 . . . . 5 (𝐹 ∈ V → (𝐹𝑆 → (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
154, 14mpcom 38 . . . 4 (𝐹𝑆 → (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
16 rnexg 7613 . . . . . . 7 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
17 fex 6988 . . . . . . . 8 ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ran 𝐺 ∈ V) → 𝐹 ∈ V)
1817expcom 416 . . . . . . 7 (ran 𝐺 ∈ V → (𝐹:ran 𝐺⟶ran 𝐻𝐹 ∈ V))
1916, 18syl 17 . . . . . 6 (𝐺 ∈ GrpOp → (𝐹:ran 𝐺⟶ran 𝐻𝐹 ∈ V))
2019adantrd 494 . . . . 5 (𝐺 ∈ GrpOp → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹 ∈ V))
2113biimprd 250 . . . . 5 (𝐹 ∈ V → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹𝑆))
2220, 21syli 39 . . . 4 (𝐺 ∈ GrpOp → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹𝑆))
2315, 22impbid2 228 . . 3 (𝐺 ∈ GrpOp → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
2423adantr 483 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
253, 24bitrd 281 1 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wcel 2110  {cab 2799  wral 3138  Vcvv 3494  ran crn 5555  wf 6350  cfv 6354  (class class class)co 7155  GrpOpcgr 28265   GrpOpHom cghomOLD 35160
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-ov 7158  df-oprab 7159  df-mpo 7160  df-ghomOLD 35161
This theorem is referenced by:  elghomOLD  35164
  Copyright terms: Public domain W3C validator