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

Theorem mhmima 13193
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 5021 . . 3 (𝐹𝑋) ⊆ ran 𝐹
2 eqid 2196 . . . . . 6 (Base‘𝑀) = (Base‘𝑀)
3 eqid 2196 . . . . . 6 (Base‘𝑁) = (Base‘𝑁)
42, 3mhmf 13167 . . . . 5 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
54adantr 276 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
65frnd 5420 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ran 𝐹 ⊆ (Base‘𝑁))
71, 6sstrid 3195 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ⊆ (Base‘𝑁))
8 eqid 2196 . . . . 5 (0g𝑀) = (0g𝑀)
9 eqid 2196 . . . . 5 (0g𝑁) = (0g𝑁)
108, 9mhm0 13170 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → (𝐹‘(0g𝑀)) = (0g𝑁))
1110adantr 276 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) = (0g𝑁))
125ffnd 5411 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 Fn (Base‘𝑀))
132submss 13178 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → 𝑋 ⊆ (Base‘𝑀))
1413adantl 277 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑋 ⊆ (Base‘𝑀))
158subm0cl 13180 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → (0g𝑀) ∈ 𝑋)
1615adantl 277 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g𝑀) ∈ 𝑋)
17 fnfvima 5800 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝑋) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1812, 14, 16, 17syl3anc 1249 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1911, 18eqeltrrd 2274 . 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 3185 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑧 ∈ (Base‘𝑀))
24 simprr 531 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥𝑋)
2521, 24sseldd 3185 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥 ∈ (Base‘𝑀))
26 eqid 2196 . . . . . . . . . 10 (+g𝑀) = (+g𝑀)
27 eqid 2196 . . . . . . . . . 10 (+g𝑁) = (+g𝑁)
282, 26, 27mhmlin 13169 . . . . . . . . 9 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑧 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
2920, 23, 25, 28syl3anc 1249 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
3012adantr 276 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝐹 Fn (Base‘𝑀))
3126submcl 13181 . . . . . . . . . . 11 ((𝑋 ∈ (SubMnd‘𝑀) ∧ 𝑧𝑋𝑥𝑋) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
32313expb 1206 . . . . . . . . . 10 ((𝑋 ∈ (SubMnd‘𝑀) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
3332adantll 476 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
34 fnfvima 5800 . . . . . . . . 9 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (𝑧(+g𝑀)𝑥) ∈ 𝑋) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3530, 21, 33, 34syl3anc 1249 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3629, 35eqeltrrd 2274 . . . . . . 7 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3736anassrs 400 . . . . . 6 ((((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) ∧ 𝑥𝑋) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3837ralrimiva 2570 . . . . 5 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
39 oveq2 5933 . . . . . . . . 9 (𝑦 = (𝐹𝑥) → ((𝐹𝑧)(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
4039eleq1d 2265 . . . . . . . 8 (𝑦 = (𝐹𝑥) → (((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4140ralima 5805 . . . . . . 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 2570 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋))
46 oveq1 5932 . . . . . . 7 (𝑥 = (𝐹𝑧) → (𝑥(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)𝑦))
4746eleq1d 2265 . . . . . 6 (𝑥 = (𝐹𝑧) → ((𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4847ralbidv 2497 . . . . 5 (𝑥 = (𝐹𝑧) → (∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4948ralima 5805 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5012, 14, 49syl2anc 411 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5145, 50mpbird 167 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))
52 mhmrcl2 13166 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝑁 ∈ Mnd)
5352adantr 276 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑁 ∈ Mnd)
543, 9, 27issubm 13174 . . 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 2167  wral 2475  wss 3157  ran crn 4665  cima 4667   Fn wfn 5254  wf 5255  cfv 5259  (class class class)co 5925  Basecbs 12703  +gcplusg 12780  0gc0g 12958  Mndcmnd 13118   MndHom cmhm 13159  SubMndcsubmnd 13160
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-inn 9008  df-ndx 12706  df-slot 12707  df-base 12709  df-mhm 13161  df-submnd 13162
This theorem is referenced by:  rhmima  13883
  Copyright terms: Public domain W3C validator