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

Theorem grpoidinv 30889
Description: A group has a left and right identity element, and every member has a left and right inverse. (Contributed by NM, 14-Oct-2006.) (New usage is discouraged.)
Hypothesis
Ref Expression
grpfo.1 𝑋 = ran 𝐺
Assertion
Ref Expression
grpoidinv (𝐺 ∈ GrpOp → ∃𝑢𝑋𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
Distinct variable groups:   𝑥,𝑦,𝑢,𝐺   𝑢,𝑋,𝑥,𝑦

Proof of Theorem grpoidinv
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 488 . . . . . . . 8 (((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢) → (𝑢𝐺𝑧) = 𝑧)
21ralimi 3104 . . . . . . 7 (∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢) → ∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧)
3 oveq2 7424 . . . . . . . . 9 (𝑧 = 𝑥 → (𝑢𝐺𝑧) = (𝑢𝐺𝑥))
4 id 23 . . . . . . . . 9 (𝑧 = 𝑥𝑧 = 𝑥)
53, 4eqeq12d 2781 . . . . . . . 8 (𝑧 = 𝑥 → ((𝑢𝐺𝑧) = 𝑧 ↔ (𝑢𝐺𝑥) = 𝑥))
65rspccva 3582 . . . . . . 7 ((∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧𝑥𝑋) → (𝑢𝐺𝑥) = 𝑥)
72, 6sylan 592 . . . . . 6 ((∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢) ∧ 𝑥𝑋) → (𝑢𝐺𝑥) = 𝑥)
87adantll 727 . . . . 5 (((𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)) ∧ 𝑥𝑋) → (𝑢𝐺𝑥) = 𝑥)
98adantll 727 . . . 4 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → (𝑢𝐺𝑥) = 𝑥)
10 simpl 488 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) → 𝐺 ∈ GrpOp)
1110anim1i 627 . . . . . 6 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → (𝐺 ∈ GrpOp ∧ 𝑥𝑋))
12 id 23 . . . . . . . . . 10 ((𝐺 ∈ GrpOp ∧ 𝑢𝑋) → (𝐺 ∈ GrpOp ∧ 𝑢𝑋))
1312adantrr 730 . . . . . . . . 9 ((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) → (𝐺 ∈ GrpOp ∧ 𝑢𝑋))
1413adantr 486 . . . . . . . 8 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → (𝐺 ∈ GrpOp ∧ 𝑢𝑋))
152adantl 487 . . . . . . . . 9 ((𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)) → ∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧)
1615ad2antlr 740 . . . . . . . 8 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → ∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧)
17 simpr 490 . . . . . . . . . . 11 (((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢) → ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)
1817ralimi 3104 . . . . . . . . . 10 (∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢) → ∀𝑧𝑋𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)
1918adantl 487 . . . . . . . . 9 ((𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)) → ∀𝑧𝑋𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)
2019ad2antlr 740 . . . . . . . 8 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → ∀𝑧𝑋𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)
2114, 16, 20jca32 525 . . . . . . 7 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → ((𝐺 ∈ GrpOp ∧ 𝑢𝑋) ∧ (∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ ∀𝑧𝑋𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)))
22 grpfo.1 . . . . . . . 8 𝑋 = ran 𝐺
23 biid 264 . . . . . . . 8 (∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧 ↔ ∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧)
24 biid 264 . . . . . . . 8 (∀𝑧𝑋𝑤𝑋 (𝑤𝐺𝑧) = 𝑢 ↔ ∀𝑧𝑋𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)
2522, 23, 24grpoidinvlem3 30887 . . . . . . 7 ((((𝐺 ∈ GrpOp ∧ 𝑢𝑋) ∧ (∀𝑧𝑋 (𝑢𝐺𝑧) = 𝑧 ∧ ∀𝑧𝑋𝑤𝑋 (𝑤𝐺𝑧) = 𝑢)) ∧ 𝑥𝑋) → ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))
2621, 25sylancom 600 . . . . . 6 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢))
2722grpoidinvlem4 30888 . . . . . 6 (((𝐺 ∈ GrpOp ∧ 𝑥𝑋) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)) → (𝑥𝐺𝑢) = (𝑢𝐺𝑥))
2811, 26, 27syl2anc 596 . . . . 5 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → (𝑥𝐺𝑢) = (𝑢𝐺𝑥))
2928, 9eqtrd 2800 . . . 4 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → (𝑥𝐺𝑢) = 𝑥)
309, 29, 26jca31 524 . . 3 (((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) ∧ 𝑥𝑋) → (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
3130ralrimiva 3159 . 2 ((𝐺 ∈ GrpOp ∧ (𝑢𝑋 ∧ ∀𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))) → ∀𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
3222grpolidinv 30882 . 2 (𝐺 ∈ GrpOp → ∃𝑢𝑋𝑧𝑋 ((𝑢𝐺𝑧) = 𝑧 ∧ ∃𝑤𝑋 (𝑤𝐺𝑧) = 𝑢))
3331, 32reximddv 3183 1 (𝐺 ∈ GrpOp → ∃𝑢𝑋𝑥𝑋 (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ∧ ∃𝑦𝑋 ((𝑦𝐺𝑥) = 𝑢 ∧ (𝑥𝐺𝑦) = 𝑢)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  wral 3081  wrex 3091  ran crn 5664  (class class class)co 7416  GrpOpcgr 30870
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fo 6546  df-fv 6548  df-ov 7419  df-grpo 30874
This theorem is used by:  grpoideu  30890  grpoidval  30894  grpoidinv2  30896  grpomndo  38559
  Copyright terms: Public domain W3C validator