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 32651
Description: Obsolete as of 15-Mar-2020. Lemma for elghomOLD 32652. (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 32650 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐺 GrpOpHom 𝐻) = 𝑆)
32eleq2d 2672 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ 𝐹𝑆))
4 elex 3184 . . . . 5 (𝐹𝑆𝐹 ∈ V)
5 feq1 5925 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓:ran 𝐺⟶ran 𝐻𝐹:ran 𝐺⟶ran 𝐻))
6 fveq1 6087 . . . . . . . . . . 11 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
7 fveq1 6087 . . . . . . . . . . 11 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
86, 7oveq12d 6545 . . . . . . . . . 10 (𝑓 = 𝐹 → ((𝑓𝑥)𝐻(𝑓𝑦)) = ((𝐹𝑥)𝐻(𝐹𝑦)))
9 fveq1 6087 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑓‘(𝑥𝐺𝑦)) = (𝐹‘(𝑥𝐺𝑦)))
108, 9eqeq12d 2624 . . . . . . . . 9 (𝑓 = 𝐹 → (((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
11102ralbidv 2971 . . . . . . . 8 (𝑓 = 𝐹 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦)) ↔ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
125, 11anbi12d 742 . . . . . . 7 (𝑓 = 𝐹 → ((𝑓:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑓𝑥)𝐻(𝑓𝑦)) = (𝑓‘(𝑥𝐺𝑦))) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
1312, 1elab2g 3321 . . . . . 6 (𝐹 ∈ V → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
1413biimpd 217 . . . . 5 (𝐹 ∈ V → (𝐹𝑆 → (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
154, 14mpcom 37 . . . 4 (𝐹𝑆 → (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))))
16 rnexg 6967 . . . . . . 7 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
17 fex 6372 . . . . . . . 8 ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ran 𝐺 ∈ V) → 𝐹 ∈ V)
1817expcom 449 . . . . . . 7 (ran 𝐺 ∈ V → (𝐹:ran 𝐺⟶ran 𝐻𝐹 ∈ V))
1916, 18syl 17 . . . . . 6 (𝐺 ∈ GrpOp → (𝐹:ran 𝐺⟶ran 𝐻𝐹 ∈ V))
2019adantrd 482 . . . . 5 (𝐺 ∈ GrpOp → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹 ∈ V))
2113biimprd 236 . . . . 5 (𝐹 ∈ V → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹𝑆))
2220, 21syli 38 . . . 4 (𝐺 ∈ GrpOp → ((𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦))) → 𝐹𝑆))
2315, 22impbid2 214 . . 3 (𝐺 ∈ GrpOp → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
2423adantr 479 . 2 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹𝑆 ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
253, 24bitrd 266 1 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp) → (𝐹 ∈ (𝐺 GrpOpHom 𝐻) ↔ (𝐹:ran 𝐺⟶ran 𝐻 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝐹𝑥)𝐻(𝐹𝑦)) = (𝐹‘(𝑥𝐺𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wa 382   = wceq 1474  wcel 1976  {cab 2595  wral 2895  Vcvv 3172  ran crn 5029  wf 5786  cfv 5790  (class class class)co 6527  GrpOpcgr 26493   GrpOpHom cghomOLD 32648
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2033  ax-13 2233  ax-ext 2589  ax-rep 4693  ax-sep 4703  ax-nul 4712  ax-pow 4764  ax-pr 4828  ax-un 6824
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-reu 2902  df-rab 2904  df-v 3174  df-sbc 3402  df-csb 3499  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-nul 3874  df-if 4036  df-pw 4109  df-sn 4125  df-pr 4127  df-op 4131  df-uni 4367  df-iun 4451  df-br 4578  df-opab 4638  df-mpt 4639  df-id 4943  df-xp 5034  df-rel 5035  df-cnv 5036  df-co 5037  df-dm 5038  df-rn 5039  df-res 5040  df-ima 5041  df-iota 5754  df-fun 5792  df-fn 5793  df-f 5794  df-f1 5795  df-fo 5796  df-f1o 5797  df-fv 5798  df-ov 6530  df-oprab 6531  df-mpt2 6532  df-ghomOLD 32649
This theorem is referenced by:  elghomOLD  32652
  Copyright terms: Public domain W3C validator