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

Theorem mhmex 13667
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 6888 . . . . 5 𝑚 Fn (V × V)
2 basfn 13263 . . . . . 6 Base Fn V
3 simpr 110 . . . . . . 7 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑇 ∈ Mnd)
43elexd 2826 . . . . . 6 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑇 ∈ V)
5 funfvex 5686 . . . . . . 7 ((Fun Base ∧ 𝑇 ∈ dom Base) → (Base‘𝑇) ∈ V)
65funfni 5457 . . . . . 6 ((Base Fn V ∧ 𝑇 ∈ V) → (Base‘𝑇) ∈ V)
72, 4, 6sylancr 414 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (Base‘𝑇) ∈ V)
8 simpl 109 . . . . . . 7 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑆 ∈ Mnd)
98elexd 2826 . . . . . 6 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → 𝑆 ∈ V)
10 funfvex 5686 . . . . . . 7 ((Fun Base ∧ 𝑆 ∈ dom Base) → (Base‘𝑆) ∈ V)
1110funfni 5457 . . . . . 6 ((Base Fn V ∧ 𝑆 ∈ V) → (Base‘𝑆) ∈ V)
122, 9, 11sylancr 414 . . . . 5 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (Base‘𝑆) ∈ V)
13 fnovex 6082 . . . . 5 (( ↑𝑚 Fn (V × V) ∧ (Base‘𝑇) ∈ V ∧ (Base‘𝑆) ∈ V) → ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∈ V)
141, 7, 12, 13mp3an2i 1379 . . . 4 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∈ V)
15 rabexg 4254 . . . 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 5669 . . . . . 6 (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
1817oveq2d 6065 . . . . 5 (𝑠 = 𝑆 → ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) = ((Base‘𝑡) ↑𝑚 (Base‘𝑆)))
19 fveq2 5669 . . . . . . . . . 10 (𝑠 = 𝑆 → (+g𝑠) = (+g𝑆))
2019oveqd 6066 . . . . . . . . 9 (𝑠 = 𝑆 → (𝑥(+g𝑠)𝑦) = (𝑥(+g𝑆)𝑦))
2120fveqeq2d 5677 . . . . . . . 8 (𝑠 = 𝑆 → ((𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦))))
2217, 21raleqbidv 2756 . . . . . . 7 (𝑠 = 𝑆 → (∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦))))
2317, 22raleqbidv 2756 . . . . . 6 (𝑠 = 𝑆 → (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦))))
24 fveq2 5669 . . . . . . 7 (𝑠 = 𝑆 → (0g𝑠) = (0g𝑆))
2524fveqeq2d 5677 . . . . . 6 (𝑠 = 𝑆 → ((𝑓‘(0g𝑠)) = (0g𝑡) ↔ (𝑓‘(0g𝑆)) = (0g𝑡)))
2623, 25anbi12d 473 . . . . 5 (𝑠 = 𝑆 → ((∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡)) ↔ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡))))
2718, 26rabeqbidv 2807 . . . 4 (𝑠 = 𝑆 → {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))} = {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡))})
28 fveq2 5669 . . . . . 6 (𝑡 = 𝑇 → (Base‘𝑡) = (Base‘𝑇))
2928oveq1d 6064 . . . . 5 (𝑡 = 𝑇 → ((Base‘𝑡) ↑𝑚 (Base‘𝑆)) = ((Base‘𝑇) ↑𝑚 (Base‘𝑆)))
30 fveq2 5669 . . . . . . . . 9 (𝑡 = 𝑇 → (+g𝑡) = (+g𝑇))
3130oveqd 6066 . . . . . . . 8 (𝑡 = 𝑇 → ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)))
3231eqeq2d 2244 . . . . . . 7 (𝑡 = 𝑇 → ((𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ (𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦))))
33322ralbidv 2566 . . . . . 6 (𝑡 = 𝑇 → (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ↔ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦))))
34 fveq2 5669 . . . . . . 7 (𝑡 = 𝑇 → (0g𝑡) = (0g𝑇))
3534eqeq2d 2244 . . . . . 6 (𝑡 = 𝑇 → ((𝑓‘(0g𝑆)) = (0g𝑡) ↔ (𝑓‘(0g𝑆)) = (0g𝑇)))
3633, 35anbi12d 473 . . . . 5 (𝑡 = 𝑇 → ((∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡)) ↔ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))))
3729, 36rabeqbidv 2807 . . . 4 (𝑡 = 𝑇 → {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑡))} = {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))})
38 df-mhm 13664 . . . 4 MndHom = (𝑠 ∈ Mnd, 𝑡 ∈ Mnd ↦ {𝑓 ∈ ((Base‘𝑡) ↑𝑚 (Base‘𝑠)) ∣ (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g𝑠)𝑦)) = ((𝑓𝑥)(+g𝑡)(𝑓𝑦)) ∧ (𝑓‘(0g𝑠)) = (0g𝑡))})
3927, 37, 38ovmpog 6187 . . 3 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))} ∈ V) → (𝑆 MndHom 𝑇) = {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))})
4016, 39mpd3an3 1375 . 2 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑆 MndHom 𝑇) = {𝑓 ∈ ((Base‘𝑇) ↑𝑚 (Base‘𝑆)) ∣ (∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝑓‘(𝑥(+g𝑆)𝑦)) = ((𝑓𝑥)(+g𝑇)(𝑓𝑦)) ∧ (𝑓‘(0g𝑆)) = (0g𝑇))})
4140, 16eqeltrd 2309 1 ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑆 MndHom 𝑇) ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  wral 2520  {crab 2524  Vcvv 2812   × cxp 4746   Fn wfn 5346  cfv 5351  (class class class)co 6049  𝑚 cmap 6881  Basecbs 13204  +gcplusg 13282  0gc0g 13461  Mndcmnd 13621   MndHom cmhm 13662
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8217  ax-resscn 8218  ax-1re 8220  ax-addrcl 8223
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-map 6883  df-inn 9237  df-ndx 13207  df-slot 13208  df-base 13210  df-mhm 13664
This theorem is referenced by:  ghmex  13964
  Copyright terms: Public domain W3C validator