Theorem ismndd 18693

Description: Deduce a monoid from its properties. (Contributed by Mario Carneiro, 6-Jan-2015.)

Hypotheses

Ref	Expression
ismndd.b	⊢ (𝜑 → 𝐵 = (Base‘𝐺))
ismndd.p	⊢ (𝜑 → + = (+g‘𝐺))
ismndd.c	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
ismndd.a	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
ismndd.z	⊢ (𝜑 → 0 ∈ 𝐵)
ismndd.i	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥)
ismndd.j	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 + 0 ) = 𝑥)

Assertion

Ref	Expression
ismndd	⊢ (𝜑 → 𝐺 ∈ Mnd)

Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐺,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥, 0

Allowed substitution hints:   + (𝑥,𝑦,𝑧)   0 (𝑦,𝑧)

Proof of Theorem ismndd

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ismndd.c	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
2	1	3expb 1121	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + 𝑦) ∈ 𝐵)
3		simpll 767	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) → 𝜑)
4		simplrl 777	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) → 𝑥 ∈ 𝐵)
5		simplrr 778	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) → 𝑦 ∈ 𝐵)
6		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) → 𝑧 ∈ 𝐵)
7		ismndd.a	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
8	3, 4, 5, 6, 7	syl13anc 1375	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
9	8	ralrimiva 3130	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
10	2, 9	jca 511	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))))
11	10	ralrimivva 3181	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))))
12		ismndd.b	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐺))
13		ismndd.p	. . . . . . . 8 ⊢ (𝜑 → + = (+g‘𝐺))
14	13	oveqd 7385	. . . . . . 7 ⊢ (𝜑 → (𝑥 + 𝑦) = (𝑥(+g‘𝐺)𝑦))
15	14, 12	eleq12d 2831	. . . . . 6 ⊢ (𝜑 → ((𝑥 + 𝑦) ∈ 𝐵 ↔ (𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺)))
16		eqidd 2738	. . . . . . . . 9 ⊢ (𝜑 → 𝑧 = 𝑧)
17	13, 14, 16	oveq123d 7389	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 + 𝑦) + 𝑧) = ((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧))
18		eqidd 2738	. . . . . . . . 9 ⊢ (𝜑 → 𝑥 = 𝑥)
19	13	oveqd 7385	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 + 𝑧) = (𝑦(+g‘𝐺)𝑧))
20	13, 18, 19	oveq123d 7389	. . . . . . . 8 ⊢ (𝜑 → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))
21	17, 20	eqeq12d 2753	. . . . . . 7 ⊢ (𝜑 → (((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)) ↔ ((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))))
22	12, 21	raleqbidv 3318	. . . . . 6 ⊢ (𝜑 → (∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)) ↔ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))))
23	15, 22	anbi12d 633	. . . . 5 ⊢ (𝜑 → (((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ↔ ((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))))
24	12, 23	raleqbidv 3318	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ↔ ∀𝑦 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))))
25	12, 24	raleqbidv 3318	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ↔ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))))
26	11, 25	mpbid 232	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))))
27		ismndd.z	. . . 4 ⊢ (𝜑 → 0 ∈ 𝐵)
28	27, 12	eleqtrd 2839	. . 3 ⊢ (𝜑 → 0 ∈ (Base‘𝐺))
29	12	eleq2d 2823	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝐺)))
30	29	biimpar 477	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) → 𝑥 ∈ 𝐵)
31	13	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → + = (+g‘𝐺))
32	31	oveqd 7385	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = ( 0 (+g‘𝐺)𝑥))
33		ismndd.i	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥)
34	32, 33	eqtr3d 2774	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( 0 (+g‘𝐺)𝑥) = 𝑥)
35	31	oveqd 7385	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 + 0 ) = (𝑥(+g‘𝐺) 0 ))
36		ismndd.j	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 + 0 ) = 𝑥)
37	35, 36	eqtr3d 2774	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝐺) 0 ) = 𝑥)
38	34, 37	jca 511	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (( 0 (+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺) 0 ) = 𝑥))
39	30, 38	syldan 592	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) → (( 0 (+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺) 0 ) = 𝑥))
40	39	ralrimiva 3130	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐺)(( 0 (+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺) 0 ) = 𝑥))
41		oveq1 7375	. . . . . 6 ⊢ (𝑢 = 0 → (𝑢(+g‘𝐺)𝑥) = ( 0 (+g‘𝐺)𝑥))
42	41	eqeq1d 2739	. . . . 5 ⊢ (𝑢 = 0 → ((𝑢(+g‘𝐺)𝑥) = 𝑥 ↔ ( 0 (+g‘𝐺)𝑥) = 𝑥))
43	42	ovanraleqv 7392	. . . 4 ⊢ (𝑢 = 0 → (∀𝑥 ∈ (Base‘𝐺)((𝑢(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑢) = 𝑥) ↔ ∀𝑥 ∈ (Base‘𝐺)(( 0 (+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺) 0 ) = 𝑥)))
44	43	rspcev 3578	. . 3 ⊢ (( 0 ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ (Base‘𝐺)(( 0 (+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺) 0 ) = 𝑥)) → ∃𝑢 ∈ (Base‘𝐺)∀𝑥 ∈ (Base‘𝐺)((𝑢(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑢) = 𝑥))
45	28, 40, 44	syl2anc 585	. 2 ⊢ (𝜑 → ∃𝑢 ∈ (Base‘𝐺)∀𝑥 ∈ (Base‘𝐺)((𝑢(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑢) = 𝑥))
46		eqid 2737	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
47		eqid 2737	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
48	46, 47	ismnd 18674	. 2 ⊢ (𝐺 ∈ Mnd ↔ (∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))) ∧ ∃𝑢 ∈ (Base‘𝐺)∀𝑥 ∈ (Base‘𝐺)((𝑢(+g‘𝐺)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐺)𝑢) = 𝑥)))
49	26, 45, 48	sylanbrc 584	1 ⊢ (𝜑 → 𝐺 ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062  ‘cfv 6500  (class class class)co 7368  Basecbs 17148  +_gcplusg 17189  Mndcmnd 18671

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-iota 6456  df-fv 6508  df-ov 7371  df-mgm 18577  df-sgrp 18656  df-mnd 18672

This theorem is referenced by:  issubmnd  18698  prdsmndd  18707  imasmnd2  18711  frmdmnd  18796  isgrpde  18899  oppgmnd  19295  isringd  20238  iscrngd  20239  xrsmcmn  21358  xrs1mnd  21407  rloccring  33364  idlsrgmnd  33607  bj-endmnd  37573  endmndlem  49374