ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  issgrpd GIF version

Theorem issgrpd 13780
Description: Deduce a semigroup from its properties. (Contributed by AV, 13-Feb-2025.)
Hypotheses
Ref Expression
issgrpd.b (𝜑 → 𝐵 = (Base‘𝐺))
issgrpd.p (𝜑 → + = (+g‘𝐺))
issgrpd.c ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
issgrpd.a ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
issgrpd.v (𝜑 → 𝐺 ∈ 𝑉)
Assertion
Ref Expression
issgrpd (𝜑 → 𝐺 ∈ Smgrp)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐺,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧
Allowed substitution hints:   + (𝑥, 𝑦, 𝑧)   𝑉(𝑥, 𝑦, 𝑧)

Proof of Theorem issgrpd
StepHypRef Expression
1 issgrpd.c . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
213expib 1237 . . . . . 6 (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵))
3 issgrpd.b . . . . . . . 8 (𝜑 → 𝐵 = (Base‘𝐺))
43eleq2d 2308 . . . . . . 7 (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝐺)))
53eleq2d 2308 . . . . . . 7 (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐺)))
64, 5anbi12d 477 . . . . . 6 (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))))
7 issgrpd.p . . . . . . . 8 (𝜑 → + = (+g‘𝐺))
87oveqd 6102 . . . . . . 7 (𝜑 → (𝑥 + 𝑦) = (𝑥(+g‘𝐺)𝑦))
98, 3eleq12d 2309 . . . . . 6 (𝜑 → ((𝑥 + 𝑦) ∈ 𝐵 ↔ (𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺)))
102, 6, 93imtr3d 202 . . . . 5 (𝜑 → ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺)))
1110imp 124 . . . 4 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺))
12 df-3an 1011 . . . . . . . . 9 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 ∈ 𝐵))
13 issgrpd.a . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
1412, 13sylan2br 288 . . . . . . . 8 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
1514ex 115 . . . . . . 7 (𝜑 → (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 ∈ 𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))))
163eleq2d 2308 . . . . . . . 8 (𝜑 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ (Base‘𝐺)))
176, 16anbi12d 477 . . . . . . 7 (𝜑 → (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 ∈ 𝐵) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑧 ∈ (Base‘𝐺))))
18 eqidd 2239 . . . . . . . . 9 (𝜑 → 𝑧 = 𝑧)
197, 8, 18oveq123d 6106 . . . . . . . 8 (𝜑 → ((𝑥 + 𝑦) + 𝑧) = ((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧))
20 eqidd 2239 . . . . . . . . 9 (𝜑 → 𝑥 = 𝑥)
217oveqd 6102 . . . . . . . . 9 (𝜑 → (𝑦 + 𝑧) = (𝑦(+g‘𝐺)𝑧))
227, 20, 21oveq123d 6106 . . . . . . . 8 (𝜑 → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))
2319, 22eqeq12d 2253 . . . . . . 7 (𝜑 → (((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)) ↔ ((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))))
2415, 17, 233imtr3d 202 . . . . . 6 (𝜑 → (((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))))
2524impl 380 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))
2625ralrimiva 2623 . . . 4 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))
2711, 26jca 306 . . 3 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → ((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))))
2827ralrimivva 2632 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧))))
29 issgrpd.v . . 3 (𝜑 → 𝐺 ∈ 𝑉)
30 eqid 2238 . . . 4 (Base‘𝐺) = (Base‘𝐺)
31 eqid 2238 . . . 4 (+g‘𝐺) = (+g‘𝐺)
3230, 31issgrpv 13772 . . 3 (𝐺 ∈ 𝑉 → (𝐺 ∈ Smgrp ↔ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))))
3329, 32syl 14 . 2 (𝜑 → (𝐺 ∈ Smgrp ↔ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g‘𝐺)𝑦)(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)(𝑦(+g‘𝐺)𝑧)))))
3428, 33mpbird 167 1 (𝜑 → 𝐺 ∈ Smgrp)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +gcplusg 13484  Smgrpcsgrp 13769
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-plusg 13497  df-mgm 13729  df-sgrp 13770
This theorem is used by:  prdssgrpd  14275  isrngd  14336
  Copyright terms: Public domain W3C validator