ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mhmex GIF version

Theorem mhmex 13771
Description: The set of monoid homomorphisms exists. (Contributed by Jim Kingdon, 15-May-2025.)
Assertion
Ref Expression
mhmex ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑆 MndHom 𝑇) ∈ V)

Proof of Theorem mhmex
Dummy variables 𝑓 𝑠 𝑡 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fnmap 6929 . . . . 5 𝑚 Fn (V × V)
2 basfn 13413 . . . . . 6 Base Fn V
3 simpr 110 . . . . . . 7 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑇 ∈ Mnd)
43elexd 2835 . . . . . 6 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑇 ∈ V)
5 funfvex 5712 . . . . . . 7 ((Fun Base ∧ 𝑇 ∈ dom Base) → (Base‘𝑇) ∈ V)
65funfni 5483 . . . . . 6 ((Base Fn V ∧ 𝑇 ∈ V) → (Base‘𝑇) ∈ V)
72, 4, 6sylancr 418 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (Base‘𝑇) ∈ V)
8 simpl 109 . . . . . . 7 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑆 ∈ Mnd)
98elexd 2835 . . . . . 6 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑆 ∈ V)
10 funfvex 5712 . . . . . . 7 ((Fun Base ∧ 𝑆 ∈ dom Base) → (Base‘𝑆) ∈ V)
1110funfni 5483 . . . . . 6 ((Base Fn V ∧ 𝑆 ∈ V) → (Base‘𝑆) ∈ V)
122, 9, 11sylancr 418 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (Base‘𝑆) ∈ V)
13 fnovex 6118 . . . . 5 (( ↑𝑚 Fn (V × V) ∧ (Base‘𝑇) ∈ V ∧ (Base‘𝑆) ∈ V) → ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∈ V)
141, 7, 12, 13mp3an2i 1383 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∈ V)
15 rabexg 4279 . . . 4 (((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∈ V → {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))} ∈ V)
1614, 15syl 14 . . 3 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))} ∈ V)
17 fveq2 5695 . . . . . 6 (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
1817oveq2d 6101 . . . . 5 (𝑠 = 𝑆 → ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) = ((Base‘𝑡) ↑𝑚 (Base‘𝑆)))
19 fveq2 5695 . . . . . . . . . 10 (𝑠 = 𝑆 → (+g𝑠) = (+g𝑆))
2019oveqd 6102 . . . . . . . . 9 (𝑠 = 𝑆 → (𝑥(+g𝑠)𝑦) = (𝑥(+g𝑆)𝑦))
2120fveqeq2d 5703 . . . . . . . 8 (𝑠 = 𝑆 → ((𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦))))
2217, 21raleqbidv 2765 . . . . . . 7 (𝑠 = 𝑆 → (∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦))))
2317, 22raleqbidv 2765 . . . . . 6 (𝑠 = 𝑆 → (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦))))
24 fveq2 5695 . . . . . . 7 (𝑠 = 𝑆 → (0g𝑠) = (0g𝑆))
2524fveqeq2d 5703 . . . . . 6 (𝑠 = 𝑆 → ((𝑓‘(0g𝑠)) = (0g𝑡) ↔ (𝑓‘(0g𝑆)) = (0g𝑡)))
2623, 25anbi12d 477 . . . . 5 (𝑠 = 𝑆 → ((∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡)) ↔ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡))))
2718, 26rabeqbidv 2816 . . . 4 (𝑠 = 𝑆 → {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))} = {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡))})
28 fveq2 5695 . . . . . 6 (𝑡 = 𝑇 → (Base‘𝑡) = (Base‘𝑇))
2928oveq1d 6100 . . . . 5 (𝑡 = 𝑇 → ((Base‘𝑡) ↑𝑚 (Base‘𝑆)) = ((Base‘𝑇) ↑𝑚 (Base‘𝑆)))
30 fveq2 5695 . . . . . . . . 9 (𝑡 = 𝑇 → (+g𝑡) = (+g𝑇))
3130oveqd 6102 . . . . . . . 8 (𝑡 = 𝑇 → ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
3231eqeq2d 2250 . . . . . . 7 (𝑡 = 𝑇 → ((𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦))))
33322ralbidv 2574 . . . . . 6 (𝑡 = 𝑇 → (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦))))
34 fveq2 5695 . . . . . . 7 (𝑡 = 𝑇 → (0g𝑡) = (0g𝑇))
3534eqeq2d 2250 . . . . . 6 (𝑡 = 𝑇 → ((𝑓‘(0g𝑆)) = (0g𝑡) ↔ (𝑓‘(0g𝑆)) = (0g𝑇)))
3633, 35anbi12d 477 . . . . 5 (𝑡 = 𝑇 → ((∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡)) ↔ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))))
3729, 36rabeqbidv 2816 . . . 4 (𝑡 = 𝑇 → {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡))} = {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))})
38 df-mhm 13768 . . . 4 MndHom = (𝑠 ∈ Mnd, 𝑡 ∈ Mnd ↦ {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))})
3927, 37, 38ovmpog 6223 . . 3 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))} ∈ V) → (𝑆 MndHom 𝑇) = {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))})
4016, 39mpd3an3 1379 . 2 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑆 MndHom 𝑇) = {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))})
4140, 16eqeltrd 2315 1 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑆 MndHom 𝑇) ∈ V)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  wral 2528  {crab 2532  Vcvv 2821   × cxp 4772   Fn wfn 5372  cfv 5377  (class class class)co 6085  𝑚 cmap 6922  Basecbs 13354  +gcplusg 13433  0gc0g 13612  Mndcmnd 13731   MndHom cmhm 13766
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-inn 9306  df-ndx 13357  df-slot 13358  df-base 13360  df-mhm 13768
This theorem is used by:  ghmex  14060
  Copyright terms: Public domain W3C validator