imasmnd - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > imasmnd		Structured version Visualization version GIF version

Theorem imasmnd 18741

Description: The image structure of a monoid is a monoid. (Contributed by Mario Carneiro, 24-Feb-2015.)

**Hypotheses**
Ref	Expression
imasmnd.u	⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
imasmnd.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
imasmnd.p	⊢ + = (+_g‘𝑅)
imasmnd.f	⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
imasmnd.e	⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
imasmnd.r	⊢ (𝜑 → 𝑅 ∈ Mnd)
imasmnd.z	⊢ 0 = (0_g‘𝑅)

**Assertion**
Ref	Expression
imasmnd	⊢ (𝜑 → (𝑈 ∈ Mnd ∧ (𝐹‘ 0 ) = (0_g‘𝑈)))

Distinct variable groups: 𝑞,𝑝, + 𝑎,𝑏,𝑝,𝑞,𝜑 𝑈,𝑎,𝑏,𝑝,𝑞 0 ,𝑝,𝑞 𝐵,𝑝,𝑞 𝐹,𝑎,𝑏,𝑝,𝑞 𝑅,𝑝,𝑞 𝑉,𝑎,𝑏,𝑝,𝑞 Allowed substitution hints: 𝐵(𝑎,𝑏) + (𝑎,𝑏) 𝑅(𝑎,𝑏) 0 (𝑎,𝑏)

Proof of Theorem imasmnd Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imasmnd.u	. 2 ⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
2		imasmnd.v	. 2 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		imasmnd.p	. 2 ⊢ + = (+_g‘𝑅)
4		imasmnd.f	. 2 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
5		imasmnd.e	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
6		imasmnd.r	. 2 ⊢ (𝜑 → 𝑅 ∈ Mnd)
7	6	3ad2ant1 1139	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → 𝑅 ∈ Mnd)
8		simp2 1143	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → 𝑥 ∈ 𝑉)
9	2	3ad2ant1 1139	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → 𝑉 = (Base‘𝑅))
10	8, 9	eleqtrd 2842	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑅))
11		simp3 1144	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → 𝑦 ∈ 𝑉)
12	11, 9	eleqtrd 2842	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → 𝑦 ∈ (Base‘𝑅))
13		eqid 2740	. . . . 5 ⊢ (Base‘𝑅) = (Base‘𝑅)
14	13, 3	mndcl 18708	. . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
15	7, 10, 12, 14	syl3anc 1379	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 + 𝑦) ∈ (Base‘𝑅))
16	15, 9	eleqtrrd 2843	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
17	6	adantr 481	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑅 ∈ Mnd)
18	10	3adant3r3 1191	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑥 ∈ (Base‘𝑅))
19	12	3adant3r3 1191	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑦 ∈ (Base‘𝑅))
20		simpr3 1203	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑧 ∈ 𝑉)
21	2	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑉 = (Base‘𝑅))
22	20, 21	eleqtrd 2842	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑧 ∈ (Base‘𝑅))
23	13, 3	mndass 18709	. . . 4 ⊢ ((𝑅 ∈ Mnd ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
24	17, 18, 19, 22, 23	syl13anc 1380	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
25	24	fveq2d 6838	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
26		imasmnd.z	. . . . 5 ⊢ 0 = (0_g‘𝑅)
27	13, 26	mndidcl 18715	. . . 4 ⊢ (𝑅 ∈ Mnd → 0 ∈ (Base‘𝑅))
28	6, 27	syl 17	. . 3 ⊢ (𝜑 → 0 ∈ (Base‘𝑅))
29	28, 2	eleqtrrd 2843	. 2 ⊢ (𝜑 → 0 ∈ 𝑉)
30	2	eleq2d 2826	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↔ 𝑥 ∈ (Base‘𝑅)))
31	30	biimpa 477	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑅))
32	13, 3, 26	mndlid 18720	. . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝑥 ∈ (Base‘𝑅)) → ( 0 + 𝑥) = 𝑥)
33	6, 31, 32	syl2an2r 691	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ( 0 + 𝑥) = 𝑥)
34	33	fveq2d 6838	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹‘𝑥))
35	13, 3, 26	mndrid 18721	. . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝑥 ∈ (Base‘𝑅)) → (𝑥 + 0 ) = 𝑥)
36	6, 31, 35	syl2an2r 691	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝑥 + 0 ) = 𝑥)
37	36	fveq2d 6838	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘(𝑥 + 0 )) = (𝐹‘𝑥))
38	1, 2, 3, 4, 5, 6, 16, 25, 29, 34, 37	imasmnd2 18740	1 ⊢ (𝜑 → (𝑈 ∈ Mnd ∧ (𝐹‘ 0 ) = (0_g‘𝑈)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 –onto→wfo 6490 ‘cfv 6492 (class class class)co 7363 Basecbs 17177 +_gcplusg 17218 0_gc0g 17400 “_s cimas 17466 Mndcmnd 18700

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9352 df-inf 9353 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-3 12243 df-4 12244 df-5 12245 df-6 12246 df-7 12247 df-8 12248 df-9 12249 df-n0 12436 df-z 12523 df-dec 12643 df-uz 12787 df-fz 13460 df-struct 17115 df-slot 17150 df-ndx 17162 df-base 17178 df-plusg 17231 df-mulr 17232 df-sca 17234 df-vsca 17235 df-ip 17236 df-tset 17237 df-ple 17238 df-ds 17240 df-0g 17402 df-imas 17470 df-mgm 18606 df-sgrp 18685 df-mnd 18701

This theorem is referenced by: imasmndf1 18742 imasmhm 33444 r1pquslmic 33701

W3C validator