Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ismndo2 Structured version   Visualization version   GIF version

Theorem ismndo2 37893
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
ismndo2.1 𝑋 = ran 𝐺
Assertion
Ref Expression
ismndo2 (𝐺𝐴 → (𝐺 ∈ MndOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
Distinct variable groups:   𝑥,𝐺,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧)

Proof of Theorem ismndo2
StepHypRef Expression
1 ismndo2.1 . . . 4 𝑋 = ran 𝐺
2 mndomgmid 37890 . . . . 5 (𝐺 ∈ MndOp → 𝐺 ∈ (Magma ∩ ExId ))
3 rngopidOLD 37872 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)
42, 3syl 17 . . . 4 (𝐺 ∈ MndOp → ran 𝐺 = dom dom 𝐺)
51, 4eqtrid 2777 . . 3 (𝐺 ∈ MndOp → 𝑋 = dom dom 𝐺)
65a1i 11 . 2 (𝐺𝐴 → (𝐺 ∈ MndOp → 𝑋 = dom dom 𝐺))
7 fdm 6656 . . . . . 6 (𝐺:(𝑋 × 𝑋)⟶𝑋 → dom 𝐺 = (𝑋 × 𝑋))
87dmeqd 5843 . . . . 5 (𝐺:(𝑋 × 𝑋)⟶𝑋 → dom dom 𝐺 = dom (𝑋 × 𝑋))
9 dmxpid 5867 . . . . 5 dom (𝑋 × 𝑋) = 𝑋
108, 9eqtr2di 2782 . . . 4 (𝐺:(𝑋 × 𝑋)⟶𝑋𝑋 = dom dom 𝐺)
11103ad2ant1 1133 . . 3 ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)) → 𝑋 = dom dom 𝐺)
1211a1i 11 . 2 (𝐺𝐴 → ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)) → 𝑋 = dom dom 𝐺))
13 eqid 2730 . . . 4 dom dom 𝐺 = dom dom 𝐺
1413ismndo1 37892 . . 3 (𝐺𝐴 → (𝐺 ∈ MndOp ↔ (𝐺:(dom dom 𝐺 × dom dom 𝐺)⟶dom dom 𝐺 ∧ ∀𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺𝑧 ∈ dom dom 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
15 xpid11 5869 . . . . . . 7 ((𝑋 × 𝑋) = (dom dom 𝐺 × dom dom 𝐺) ↔ 𝑋 = dom dom 𝐺)
1615biimpri 228 . . . . . 6 (𝑋 = dom dom 𝐺 → (𝑋 × 𝑋) = (dom dom 𝐺 × dom dom 𝐺))
17 feq23 6628 . . . . . 6 (((𝑋 × 𝑋) = (dom dom 𝐺 × dom dom 𝐺) ∧ 𝑋 = dom dom 𝐺) → (𝐺:(𝑋 × 𝑋)⟶𝑋𝐺:(dom dom 𝐺 × dom dom 𝐺)⟶dom dom 𝐺))
1816, 17mpancom 688 . . . . 5 (𝑋 = dom dom 𝐺 → (𝐺:(𝑋 × 𝑋)⟶𝑋𝐺:(dom dom 𝐺 × dom dom 𝐺)⟶dom dom 𝐺))
19 raleq 3287 . . . . . . 7 (𝑋 = dom dom 𝐺 → (∀𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑧 ∈ dom dom 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
2019raleqbi1dv 3302 . . . . . 6 (𝑋 = dom dom 𝐺 → (∀𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑦 ∈ dom dom 𝐺𝑧 ∈ dom dom 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
2120raleqbi1dv 3302 . . . . 5 (𝑋 = dom dom 𝐺 → (∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ∀𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺𝑧 ∈ dom dom 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))))
22 raleq 3287 . . . . . 6 (𝑋 = dom dom 𝐺 → (∀𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ↔ ∀𝑦 ∈ dom dom 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)))
2322rexeqbi1dv 3303 . . . . 5 (𝑋 = dom dom 𝐺 → (∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ↔ ∃𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)))
2418, 21, 233anbi123d 1438 . . . 4 (𝑋 = dom dom 𝐺 → ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)) ↔ (𝐺:(dom dom 𝐺 × dom dom 𝐺)⟶dom dom 𝐺 ∧ ∀𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺𝑧 ∈ dom dom 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
2524bibi2d 342 . . 3 (𝑋 = dom dom 𝐺 → ((𝐺 ∈ MndOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))) ↔ (𝐺 ∈ MndOp ↔ (𝐺:(dom dom 𝐺 × dom dom 𝐺)⟶dom dom 𝐺 ∧ ∀𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺𝑧 ∈ dom dom 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ dom dom 𝐺𝑦 ∈ dom dom 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)))))
2614, 25syl5ibrcom 247 . 2 (𝐺𝐴 → (𝑋 = dom dom 𝐺 → (𝐺 ∈ MndOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)))))
276, 12, 26pm5.21ndd 379 1 (𝐺𝐴 → (𝐺 ∈ MndOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥𝑋𝑦𝑋 ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2110  wral 3045  wrex 3054  cin 3899   × cxp 5612  dom cdm 5614  ran crn 5615  wf 6473  (class class class)co 7341   ExId cexid 37863  Magmacmagm 37867  MndOpcmndo 37885
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7663
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-fo 6483  df-fv 6485  df-ov 7344  df-ass 37862  df-exid 37864  df-mgmOLD 37868  df-sgrOLD 37880  df-mndo 37886
This theorem is referenced by:  grpomndo  37894
  Copyright terms: Public domain W3C validator