Theorem ismndo 38543

Description: The predicate "is a monoid". (Contributed by FL, 2-Nov-2009.) (Revised by Mario Carneiro, 22-Dec-2013.) (New usage is discouraged.)

Hypothesis

Ref	Expression
ismndo.1	⊢ 𝑋 = dom dom 𝐺

Assertion

Ref	Expression
ismndo	⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ MndOp ↔ (𝐺 ∈ SemiGrp ∧ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))

Distinct variable groups:   𝑥,𝐺,𝑦   𝑥,𝑋,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem ismndo

Step	Hyp	Ref	Expression
1		df-mndo 38538	. . 3 ⊢ MndOp = (SemiGrp ∩ ExId )
2	1	eleq2i 2855	. 2 ⊢ (𝐺 ∈ MndOp ↔ 𝐺 ∈ (SemiGrp ∩ ExId ))
3		elin 3921	. . 3 ⊢ (𝐺 ∈ (SemiGrp ∩ ExId ) ↔ (𝐺 ∈ SemiGrp ∧ 𝐺 ∈ ExId ))
4		ismndo.1	. . . . 5 ⊢ 𝑋 = dom dom 𝐺
5	4	isexid 38518	. . . 4 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ ExId ↔ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)))
6	5	anbi2d 641	. . 3 ⊢ (𝐺 ∈ 𝐴 → ((𝐺 ∈ SemiGrp ∧ 𝐺 ∈ ExId ) ↔ (𝐺 ∈ SemiGrp ∧ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
7	3, 6	bitrid 286	. 2 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ (SemiGrp ∩ ExId ) ↔ (𝐺 ∈ SemiGrp ∧ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
8	2, 7	bitrid 286	1 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ MndOp ↔ (𝐺 ∈ SemiGrp ∧ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089   ∩ cin 3904  dom cdm 5661  (class class class)co 7410   ExId cexid 38515  SemiGrpcsem 38531  MndOpcmndo 38537

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-dm 5671  df-iota 6492  df-fv 6544  df-ov 7413  df-exid 38516  df-mndo 38538

This theorem is referenced by:  ismndo1  38544