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

Theorem mhmima 13693
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 5111 . . 3 (𝐹𝑋) ⊆ ran 𝐹
2 eqid 2232 . . . . . 6 (Base‘𝑀) = (Base‘𝑀)
3 eqid 2232 . . . . . 6 (Base‘𝑁) = (Base‘𝑁)
42, 3mhmf 13667 . . . . 5 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
54adantr 276 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
65frnd 5517 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ran 𝐹 ⊆ (Base‘𝑁))
71, 6sstrid 3248 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ⊆ (Base‘𝑁))
8 eqid 2232 . . . . 5 (0g𝑀) = (0g𝑀)
9 eqid 2232 . . . . 5 (0g𝑁) = (0g𝑁)
108, 9mhm0 13670 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → (𝐹‘(0g𝑀)) = (0g𝑁))
1110adantr 276 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) = (0g𝑁))
125ffnd 5508 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 Fn (Base‘𝑀))
132submss 13678 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → 𝑋 ⊆ (Base‘𝑀))
1413adantl 277 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑋 ⊆ (Base‘𝑀))
158subm0cl 13680 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → (0g𝑀) ∈ 𝑋)
1615adantl 277 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g𝑀) ∈ 𝑋)
17 fnfvima 5920 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝑋) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1812, 14, 16, 17syl3anc 1274 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1911, 18eqeltrrd 2310 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g𝑁) ∈ (𝐹𝑋))
20 simpll 527 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝐹 ∈ (𝑀 MndHom 𝑁))
2114adantr 276 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑋 ⊆ (Base‘𝑀))
22 simprl 531 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑧𝑋)
2321, 22sseldd 3238 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑧 ∈ (Base‘𝑀))
24 simprr 533 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥𝑋)
2521, 24sseldd 3238 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥 ∈ (Base‘𝑀))
26 eqid 2232 . . . . . . . . . 10 (+g𝑀) = (+g𝑀)
27 eqid 2232 . . . . . . . . . 10 (+g𝑁) = (+g𝑁)
282, 26, 27mhmlin 13669 . . . . . . . . 9 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑧 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
2920, 23, 25, 28syl3anc 1274 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
3012adantr 276 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝐹 Fn (Base‘𝑀))
3126submcl 13681 . . . . . . . . . . 11 ((𝑋 ∈ (SubMnd‘𝑀) ∧ 𝑧𝑋𝑥𝑋) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
32313expb 1231 . . . . . . . . . 10 ((𝑋 ∈ (SubMnd‘𝑀) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
3332adantll 476 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
34 fnfvima 5920 . . . . . . . . 9 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (𝑧(+g𝑀)𝑥) ∈ 𝑋) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3530, 21, 33, 34syl3anc 1274 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3629, 35eqeltrrd 2310 . . . . . . 7 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3736anassrs 400 . . . . . 6 ((((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) ∧ 𝑥𝑋) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3837ralrimiva 2615 . . . . 5 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
39 oveq2 6057 . . . . . . . . 9 (𝑦 = (𝐹𝑥) → ((𝐹𝑧)(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
4039eleq1d 2301 . . . . . . . 8 (𝑦 = (𝐹𝑥) → (((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4140ralima 5927 . . . . . . 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 2615 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋))
46 oveq1 6056 . . . . . . 7 (𝑥 = (𝐹𝑧) → (𝑥(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)𝑦))
4746eleq1d 2301 . . . . . 6 (𝑥 = (𝐹𝑧) → ((𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4847ralbidv 2542 . . . . 5 (𝑥 = (𝐹𝑧) → (∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4948ralima 5927 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5012, 14, 49syl2anc 411 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5145, 50mpbird 167 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))
52 mhmrcl2 13666 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝑁 ∈ Mnd)
5352adantr 276 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑁 ∈ Mnd)
543, 9, 27issubm 13674 . . 3 (𝑁 ∈ Mnd → ((𝐹𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹𝑋) ⊆ (Base‘𝑁) ∧ (0g𝑁) ∈ (𝐹𝑋) ∧ ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))))
5553, 54syl 14 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ((𝐹𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹𝑋) ⊆ (Base‘𝑁) ∧ (0g𝑁) ∈ (𝐹𝑋) ∧ ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))))
567, 19, 51, 55mpbir3and 1207 1 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ∈ (SubMnd‘𝑁))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1005   = wceq 1398  wcel 2203  wral 2520  wss 3210  ran crn 4749  cima 4751   Fn wfn 5346  wf 5347  cfv 5351  (class class class)co 6049  Basecbs 13201  +gcplusg 13279  0gc0g 13458  Mndcmnd 13618   MndHom cmhm 13659  SubMndcsubmnd 13660
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 8214  ax-resscn 8215  ax-1re 8217  ax-addrcl 8220
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 9234  df-ndx 13204  df-slot 13205  df-base 13207  df-mhm 13661  df-submnd 13662
This theorem is referenced by:  rhmima  14385
  Copyright terms: Public domain W3C validator