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

Theorem mhmima 13063
Description: The homomorphic image of a submonoid is a submonoid. (Contributed by Mario Carneiro, 10-Mar-2015.)
Assertion
Ref Expression
mhmima ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ∈ (SubMnd‘𝑁))

Proof of Theorem mhmima
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imassrn 5016 . . 3 (𝐹𝑋) ⊆ ran 𝐹
2 eqid 2193 . . . . . 6 (Base‘𝑀) = (Base‘𝑀)
3 eqid 2193 . . . . . 6 (Base‘𝑁) = (Base‘𝑁)
42, 3mhmf 13037 . . . . 5 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
54adantr 276 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
65frnd 5413 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ran 𝐹 ⊆ (Base‘𝑁))
71, 6sstrid 3190 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ⊆ (Base‘𝑁))
8 eqid 2193 . . . . 5 (0g𝑀) = (0g𝑀)
9 eqid 2193 . . . . 5 (0g𝑁) = (0g𝑁)
108, 9mhm0 13040 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → (𝐹‘(0g𝑀)) = (0g𝑁))
1110adantr 276 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) = (0g𝑁))
125ffnd 5404 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 Fn (Base‘𝑀))
132submss 13048 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → 𝑋 ⊆ (Base‘𝑀))
1413adantl 277 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑋 ⊆ (Base‘𝑀))
158subm0cl 13050 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → (0g𝑀) ∈ 𝑋)
1615adantl 277 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g𝑀) ∈ 𝑋)
17 fnfvima 5793 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝑋) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1812, 14, 16, 17syl3anc 1249 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1911, 18eqeltrrd 2271 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g𝑁) ∈ (𝐹𝑋))
20 simpll 527 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝐹 ∈ (𝑀 MndHom 𝑁))
2114adantr 276 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑋 ⊆ (Base‘𝑀))
22 simprl 529 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑧𝑋)
2321, 22sseldd 3180 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑧 ∈ (Base‘𝑀))
24 simprr 531 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥𝑋)
2521, 24sseldd 3180 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥 ∈ (Base‘𝑀))
26 eqid 2193 . . . . . . . . . 10 (+g𝑀) = (+g𝑀)
27 eqid 2193 . . . . . . . . . 10 (+g𝑁) = (+g𝑁)
282, 26, 27mhmlin 13039 . . . . . . . . 9 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑧 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
2920, 23, 25, 28syl3anc 1249 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
3012adantr 276 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝐹 Fn (Base‘𝑀))
3126submcl 13051 . . . . . . . . . . 11 ((𝑋 ∈ (SubMnd‘𝑀) ∧ 𝑧𝑋𝑥𝑋) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
32313expb 1206 . . . . . . . . . 10 ((𝑋 ∈ (SubMnd‘𝑀) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
3332adantll 476 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
34 fnfvima 5793 . . . . . . . . 9 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (𝑧(+g𝑀)𝑥) ∈ 𝑋) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3530, 21, 33, 34syl3anc 1249 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3629, 35eqeltrrd 2271 . . . . . . 7 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3736anassrs 400 . . . . . 6 ((((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) ∧ 𝑥𝑋) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3837ralrimiva 2567 . . . . 5 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
39 oveq2 5926 . . . . . . . . 9 (𝑦 = (𝐹𝑥) → ((𝐹𝑧)(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
4039eleq1d 2262 . . . . . . . 8 (𝑦 = (𝐹𝑥) → (((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4140ralima 5798 . . . . . . 7 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4212, 14, 41syl2anc 411 . . . . . 6 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4342adantr 276 . . . . 5 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → (∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4438, 43mpbird 167 . . . 4 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → ∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋))
4544ralrimiva 2567 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋))
46 oveq1 5925 . . . . . . 7 (𝑥 = (𝐹𝑧) → (𝑥(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)𝑦))
4746eleq1d 2262 . . . . . 6 (𝑥 = (𝐹𝑧) → ((𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4847ralbidv 2494 . . . . 5 (𝑥 = (𝐹𝑧) → (∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4948ralima 5798 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5012, 14, 49syl2anc 411 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5145, 50mpbird 167 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))
52 mhmrcl2 13036 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝑁 ∈ Mnd)
5352adantr 276 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑁 ∈ Mnd)
543, 9, 27issubm 13044 . . 3 (𝑁 ∈ Mnd → ((𝐹𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹𝑋) ⊆ (Base‘𝑁) ∧ (0g𝑁) ∈ (𝐹𝑋) ∧ ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))))
5553, 54syl 14 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ((𝐹𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹𝑋) ⊆ (Base‘𝑁) ∧ (0g𝑁) ∈ (𝐹𝑋) ∧ ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))))
567, 19, 51, 55mpbir3and 1182 1 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ∈ (SubMnd‘𝑁))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  wcel 2164  wral 2472  wss 3153  ran crn 4660  cima 4662   Fn wfn 5249  wf 5250  cfv 5254  (class class class)co 5918  Basecbs 12618  +gcplusg 12695  0gc0g 12867  Mndcmnd 12997   MndHom cmhm 13029  SubMndcsubmnd 13030
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-map 6704  df-inn 8983  df-ndx 12621  df-slot 12622  df-base 12624  df-mhm 13031  df-submnd 13032
This theorem is referenced by:  rhmima  13747
  Copyright terms: Public domain W3C validator