MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isgrpoi Structured version   Visualization version   GIF version

Theorem isgrpoi 28839
Description: Properties that determine a group operation. Read 𝑁 as 𝑁(𝑥). (Contributed by NM, 4-Nov-2006.) (New usage is discouraged.)
Hypotheses
Ref Expression
isgrpoi.1 𝑋 ∈ V
isgrpoi.2 𝐺:(𝑋 × 𝑋)⟶𝑋
isgrpoi.3 ((𝑥𝑋𝑦𝑋𝑧𝑋) → ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
isgrpoi.4 𝑈𝑋
isgrpoi.5 (𝑥𝑋 → (𝑈𝐺𝑥) = 𝑥)
isgrpoi.6 (𝑥𝑋𝑁𝑋)
isgrpoi.7 (𝑥𝑋 → (𝑁𝐺𝑥) = 𝑈)
Assertion
Ref Expression
isgrpoi 𝐺 ∈ GrpOp
Distinct variable groups:   𝑥,𝑦,𝑧,𝐺   𝑥,𝑈,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧   𝑦,𝑁
Allowed substitution hints:   𝑁(𝑥,𝑧)

Proof of Theorem isgrpoi
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 isgrpoi.2 . 2 𝐺:(𝑋 × 𝑋)⟶𝑋
2 isgrpoi.3 . . 3 ((𝑥𝑋𝑦𝑋𝑧𝑋) → ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
32rgen3 3129 . 2 𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧))
4 isgrpoi.4 . . 3 𝑈𝑋
5 isgrpoi.5 . . . . 5 (𝑥𝑋 → (𝑈𝐺𝑥) = 𝑥)
6 isgrpoi.6 . . . . . 6 (𝑥𝑋𝑁𝑋)
7 isgrpoi.7 . . . . . 6 (𝑥𝑋 → (𝑁𝐺𝑥) = 𝑈)
8 oveq1 7275 . . . . . . . 8 (𝑦 = 𝑁 → (𝑦𝐺𝑥) = (𝑁𝐺𝑥))
98eqeq1d 2741 . . . . . . 7 (𝑦 = 𝑁 → ((𝑦𝐺𝑥) = 𝑈 ↔ (𝑁𝐺𝑥) = 𝑈))
109rspcev 3560 . . . . . 6 ((𝑁𝑋 ∧ (𝑁𝐺𝑥) = 𝑈) → ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈)
116, 7, 10syl2anc 583 . . . . 5 (𝑥𝑋 → ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈)
125, 11jca 511 . . . 4 (𝑥𝑋 → ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈))
1312rgen 3075 . . 3 𝑥𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈)
14 oveq1 7275 . . . . . . 7 (𝑢 = 𝑈 → (𝑢𝐺𝑥) = (𝑈𝐺𝑥))
1514eqeq1d 2741 . . . . . 6 (𝑢 = 𝑈 → ((𝑢𝐺𝑥) = 𝑥 ↔ (𝑈𝐺𝑥) = 𝑥))
16 eqeq2 2751 . . . . . . 7 (𝑢 = 𝑈 → ((𝑦𝐺𝑥) = 𝑢 ↔ (𝑦𝐺𝑥) = 𝑈))
1716rexbidv 3227 . . . . . 6 (𝑢 = 𝑈 → (∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑢 ↔ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈))
1815, 17anbi12d 630 . . . . 5 (𝑢 = 𝑈 → (((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈)))
1918ralbidv 3122 . . . 4 (𝑢 = 𝑈 → (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑢) ↔ ∀𝑥𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈)))
2019rspcev 3560 . . 3 ((𝑈𝑋 ∧ ∀𝑥𝑋 ((𝑈𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑈)) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑢))
214, 13, 20mp2an 688 . 2 𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑢)
22 isgrpoi.1 . . . . 5 𝑋 ∈ V
2322, 22xpex 7594 . . . 4 (𝑋 × 𝑋) ∈ V
24 fex 7096 . . . 4 ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ (𝑋 × 𝑋) ∈ V) → 𝐺 ∈ V)
251, 23, 24mp2an 688 . . 3 𝐺 ∈ V
265eqcomd 2745 . . . . . . . . 9 (𝑥𝑋𝑥 = (𝑈𝐺𝑥))
27 rspceov 7315 . . . . . . . . . 10 ((𝑈𝑋𝑥𝑋𝑥 = (𝑈𝐺𝑥)) → ∃𝑦𝑋𝑧𝑋 𝑥 = (𝑦𝐺𝑧))
284, 27mp3an1 1446 . . . . . . . . 9 ((𝑥𝑋𝑥 = (𝑈𝐺𝑥)) → ∃𝑦𝑋𝑧𝑋 𝑥 = (𝑦𝐺𝑧))
2926, 28mpdan 683 . . . . . . . 8 (𝑥𝑋 → ∃𝑦𝑋𝑧𝑋 𝑥 = (𝑦𝐺𝑧))
3029rgen 3075 . . . . . . 7 𝑥𝑋𝑦𝑋𝑧𝑋 𝑥 = (𝑦𝐺𝑧)
31 foov 7437 . . . . . . 7 (𝐺:(𝑋 × 𝑋)–onto𝑋 ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 𝑥 = (𝑦𝐺𝑧)))
321, 30, 31mpbir2an 707 . . . . . 6 𝐺:(𝑋 × 𝑋)–onto𝑋
33 forn 6687 . . . . . 6 (𝐺:(𝑋 × 𝑋)–onto𝑋 → ran 𝐺 = 𝑋)
3432, 33ax-mp 5 . . . . 5 ran 𝐺 = 𝑋
3534eqcomi 2748 . . . 4 𝑋 = ran 𝐺
3635isgrpo 28838 . . 3 (𝐺 ∈ V → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑢))))
3725, 36ax-mp 5 . 2 (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋𝑦𝑋𝑧𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦𝑋 (𝑦𝐺𝑥) = 𝑢)))
381, 3, 21, 37mpbir3an 1339 1 𝐺 ∈ GrpOp
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  w3a 1085   = wceq 1541  wcel 2109  wral 3065  wrex 3066  Vcvv 3430   × cxp 5586  ran crn 5589  wf 6426  ontowfo 6428  (class class class)co 7268  GrpOpcgr 28830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-ov 7271  df-grpo 28834
This theorem is referenced by:  cnaddabloOLD  28922  hilablo  29501  hhssabloilem  29602  grposnOLD  36019
  Copyright terms: Public domain W3C validator