Theorem ismndo 35144

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 35139	. . 3 ⊢ MndOp = (SemiGrp ∩ ExId )
2	1	eleq2i 2904	. 2 ⊢ (𝐺 ∈ MndOp ↔ 𝐺 ∈ (SemiGrp ∩ ExId ))
3		elin 4168	. . 3 ⊢ (𝐺 ∈ (SemiGrp ∩ ExId ) ↔ (𝐺 ∈ SemiGrp ∧ 𝐺 ∈ ExId ))
4		ismndo.1	. . . . 5 ⊢ 𝑋 = dom dom 𝐺
5	4	isexid 35119	. . . 4 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ ExId ↔ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)))
6	5	anbi2d 630	. . 3 ⊢ (𝐺 ∈ 𝐴 → ((𝐺 ∈ SemiGrp ∧ 𝐺 ∈ ExId ) ↔ (𝐺 ∈ SemiGrp ∧ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
7	3, 6	syl5bb 285	. 2 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ (SemiGrp ∩ ExId ) ↔ (𝐺 ∈ SemiGrp ∧ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
8	2, 7	syl5bb 285	1 ⊢ (𝐺 ∈ 𝐴 → (𝐺 ∈ MndOp ↔ (𝐺 ∈ SemiGrp ∧ ∃𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138  ∃wrex 3139   ∩ cin 3934  dom cdm 5549  (class class class)co 7150   ExId cexid 35116  SemiGrpcsem 35132  MndOpcmndo 35138

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-dm 5559  df-iota 6308  df-fv 6357  df-ov 7153  df-exid 35117  df-mndo 35139

This theorem is referenced by:  ismndo1  35145