Theorem insubm 19014

Description: The intersection of two submonoids is a submonoid. (Contributed by AV, 25-Feb-2024.)

Assertion

Ref	Expression
insubm	⊢ ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) → (𝐴 ∩ 𝐵) ∈ (SubMnd‘𝑀))

Proof of Theorem insubm

Dummy variables 𝑎 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		submrcl 18997	. . 3 ⊢ (𝐴 ∈ (SubMnd‘𝑀) → 𝑀 ∈ Mnd)
2		ssinss1 4191	. . . . . . . . 9 ⊢ (𝐴 ⊆ (Base‘𝑀) → (𝐴 ∩ 𝐵) ⊆ (Base‘𝑀))
3	2	3ad2ant1 1151	. . . . . . . 8 ⊢ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) → (𝐴 ∩ 𝐵) ⊆ (Base‘𝑀))
4	3	ad2antrl 741	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → (𝐴 ∩ 𝐵) ⊆ (Base‘𝑀))
5		elin 3915	. . . . . . . . . . . . 13 ⊢ ((0g‘𝑀) ∈ (𝐴 ∩ 𝐵) ↔ ((0g‘𝑀) ∈ 𝐴 ∧ (0g‘𝑀) ∈ 𝐵))
6	5	simplbi2com 508	. . . . . . . . . . . 12 ⊢ ((0g‘𝑀) ∈ 𝐵 → ((0g‘𝑀) ∈ 𝐴 → (0g‘𝑀) ∈ (𝐴 ∩ 𝐵)))
7	6	3ad2ant2 1152	. . . . . . . . . . 11 ⊢ ((𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) → ((0g‘𝑀) ∈ 𝐴 → (0g‘𝑀) ∈ (𝐴 ∩ 𝐵)))
8	7	com12 33	. . . . . . . . . 10 ⊢ ((0g‘𝑀) ∈ 𝐴 → ((𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) → (0g‘𝑀) ∈ (𝐴 ∩ 𝐵)))
9	8	3ad2ant2 1152	. . . . . . . . 9 ⊢ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) → ((𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) → (0g‘𝑀) ∈ (𝐴 ∩ 𝐵)))
10	9	imp 412	. . . . . . . 8 ⊢ (((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) → (0g‘𝑀) ∈ (𝐴 ∩ 𝐵))
11	10	adantl 487	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → (0g‘𝑀) ∈ (𝐴 ∩ 𝐵))
12		elin 3915	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
13		elin 3915	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝐴 ∩ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
14	12, 13	anbi12i 640	. . . . . . . . 9 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑦 ∈ (𝐴 ∩ 𝐵)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
15		oveq1 7427	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑥 → (𝑎(+g‘𝑀)𝑏) = (𝑥(+g‘𝑀)𝑏))
16	15	eleq1d 2846	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = 𝑥 → ((𝑎(+g‘𝑀)𝑏) ∈ 𝐴 ↔ (𝑥(+g‘𝑀)𝑏) ∈ 𝐴))
17		oveq2 7428	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑦 → (𝑥(+g‘𝑀)𝑏) = (𝑥(+g‘𝑀)𝑦))
18	17	eleq1d 2846	. . . . . . . . . . . . . . . 16 ⊢ (𝑏 = 𝑦 → ((𝑥(+g‘𝑀)𝑏) ∈ 𝐴 ↔ (𝑥(+g‘𝑀)𝑦) ∈ 𝐴))
19		simpl 488	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐴)
20	19	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐴)
21		eqidd 2762	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑎 = 𝑥) → 𝐴 = 𝐴)
22		simpl 488	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐴)
23	22	adantl 487	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐴)
24	16, 18, 20, 21, 23	rspc2vd 3895	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴 → (𝑥(+g‘𝑀)𝑦) ∈ 𝐴))
25	24	com12 33	. . . . . . . . . . . . . 14 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴 → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐴))
26	25	3ad2ant3 1153	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐴))
27	26	ad2antrl 741	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐴))
28	27	imp 412	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐴)
29	15	eleq1d 2846	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑥 → ((𝑎(+g‘𝑀)𝑏) ∈ 𝐵 ↔ (𝑥(+g‘𝑀)𝑏) ∈ 𝐵))
30	17	eleq1d 2846	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑦 → ((𝑥(+g‘𝑀)𝑏) ∈ 𝐵 ↔ (𝑥(+g‘𝑀)𝑦) ∈ 𝐵))
31		simpr 490	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
32	31	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
33		eqidd 2762	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑎 = 𝑥) → 𝐵 = 𝐵)
34		simpr 490	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
35	34	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
36	29, 30, 32, 33, 35	rspc2vd 3895	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵 → (𝑥(+g‘𝑀)𝑦) ∈ 𝐵))
37	36	com12 33	. . . . . . . . . . . . . . 15 ⊢ (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵 → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐵))
38	37	3ad2ant3 1153	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐵))
39	38	adantl 487	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐵))
40	39	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐵))
41	40	imp 412	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) → (𝑥(+g‘𝑀)𝑦) ∈ 𝐵)
42	28, 41	elind 4146	. . . . . . . . . 10 ⊢ (((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) → (𝑥(+g‘𝑀)𝑦) ∈ (𝐴 ∩ 𝐵))
43	42	ex 418	. . . . . . . . 9 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ (𝐴 ∩ 𝐵)))
44	14, 43	biimtrid 245	. . . . . . . 8 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑦 ∈ (𝐴 ∩ 𝐵)) → (𝑥(+g‘𝑀)𝑦) ∈ (𝐴 ∩ 𝐵)))
45	44	ralrimivv 3204	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥(+g‘𝑀)𝑦) ∈ (𝐴 ∩ 𝐵))
46	4, 11, 45	3jca 1146	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))) → ((𝐴 ∩ 𝐵) ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ (𝐴 ∩ 𝐵) ∧ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥(+g‘𝑀)𝑦) ∈ (𝐴 ∩ 𝐵)))
47	46	ex 418	. . . . 5 ⊢ (𝑀 ∈ Mnd → (((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) → ((𝐴 ∩ 𝐵) ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ (𝐴 ∩ 𝐵) ∧ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥(+g‘𝑀)𝑦) ∈ (𝐴 ∩ 𝐵))))
48		eqid 2761	. . . . . . 7 ⊢ (Base‘𝑀) = (Base‘𝑀)
49		eqid 2761	. . . . . . 7 ⊢ (0g‘𝑀) = (0g‘𝑀)
50		eqid 2761	. . . . . . 7 ⊢ (+g‘𝑀) = (+g‘𝑀)
51	48, 49, 50	issubm 18998	. . . . . 6 ⊢ (𝑀 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴)))
52	48, 49, 50	issubm 18998	. . . . . 6 ⊢ (𝑀 ∈ Mnd → (𝐵 ∈ (SubMnd‘𝑀) ↔ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)))
53	51, 52	anbi12d 644	. . . . 5 ⊢ (𝑀 ∈ Mnd → ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) ↔ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎(+g‘𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))))
54	48, 49, 50	issubm 18998	. . . . 5 ⊢ (𝑀 ∈ Mnd → ((𝐴 ∩ 𝐵) ∈ (SubMnd‘𝑀) ↔ ((𝐴 ∩ 𝐵) ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ (𝐴 ∩ 𝐵) ∧ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥(+g‘𝑀)𝑦) ∈ (𝐴 ∩ 𝐵))))
55	47, 53, 54	3imtr4d 297	. . . 4 ⊢ (𝑀 ∈ Mnd → ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) → (𝐴 ∩ 𝐵) ∈ (SubMnd‘𝑀)))
56	55	expd 421	. . 3 ⊢ (𝑀 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝑀) → (𝐵 ∈ (SubMnd‘𝑀) → (𝐴 ∩ 𝐵) ∈ (SubMnd‘𝑀))))
57	1, 56	mpcom 39	. 2 ⊢ (𝐴 ∈ (SubMnd‘𝑀) → (𝐵 ∈ (SubMnd‘𝑀) → (𝐴 ∩ 𝐵) ∈ (SubMnd‘𝑀)))
58	57	imp 412	1 ⊢ ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) → (𝐴 ∩ 𝐵) ∈ (SubMnd‘𝑀))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∀wral 3077   ∩ cin 3898   ⊆ wss 3899  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +_gcplusg 17428  0_gc0g 17610  Mndcmnd 18923  SubMndcsubmnd 18977

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-submnd 18979

This theorem is used by:  symgsubmefmnd  19612