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

Theorem isexid2 35940
Description: If 𝐺 ∈ (Magma ∩ ExId ), then it has a left and right identity element that belongs to the range of the operation. (Contributed by FL, 12-Dec-2009.) (Revised by Mario Carneiro, 22-Dec-2013.) (New usage is discouraged.)
Hypothesis
Ref Expression
isexid2.1 𝑋 = ran 𝐺
Assertion
Ref Expression
isexid2 (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
Distinct variable groups:   𝑢,𝐺,𝑥   𝑢,𝑋,𝑥

Proof of Theorem isexid2
StepHypRef Expression
1 isexid2.1 . 2 𝑋 = ran 𝐺
2 rngopidOLD 35938 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)
3 elin 3899 . . . . . . 7 (𝐺 ∈ (Magma ∩ ExId ) ↔ (𝐺 ∈ Magma ∧ 𝐺 ∈ ExId ))
4 eqid 2738 . . . . . . . . . . 11 dom dom 𝐺 = dom dom 𝐺
54isexid 35932 . . . . . . . . . 10 (𝐺 ∈ ExId → (𝐺 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
65ibi 266 . . . . . . . . 9 (𝐺 ∈ ExId → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
76a1d 25 . . . . . . . 8 (𝐺 ∈ ExId → (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
87adantl 481 . . . . . . 7 ((𝐺 ∈ Magma ∧ 𝐺 ∈ ExId ) → (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
93, 8sylbi 216 . . . . . 6 (𝐺 ∈ (Magma ∩ ExId ) → (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
10 eqeq2 2750 . . . . . . 7 (ran 𝐺 = dom dom 𝐺 → (𝑋 = ran 𝐺𝑋 = dom dom 𝐺))
11 raleq 3333 . . . . . . . 8 (ran 𝐺 = dom dom 𝐺 → (∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1211rexeqbi1dv 3332 . . . . . . 7 (ran 𝐺 = dom dom 𝐺 → (∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1310, 12imbi12d 344 . . . . . 6 (ran 𝐺 = dom dom 𝐺 → ((𝑋 = ran 𝐺 → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) ↔ (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))))
149, 13syl5ibr 245 . . . . 5 (ran 𝐺 = dom dom 𝐺 → (𝐺 ∈ (Magma ∩ ExId ) → (𝑋 = ran 𝐺 → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))))
152, 14mpcom 38 . . . 4 (𝐺 ∈ (Magma ∩ ExId ) → (𝑋 = ran 𝐺 → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1615com12 32 . . 3 (𝑋 = ran 𝐺 → (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
17 raleq 3333 . . . 4 (𝑋 = ran 𝐺 → (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1817rexeqbi1dv 3332 . . 3 (𝑋 = ran 𝐺 → (∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1916, 18sylibrd 258 . 2 (𝑋 = ran 𝐺 → (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
201, 19ax-mp 5 1 (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  wral 3063  wrex 3064  cin 3882  dom cdm 5580  ran crn 5581  (class class class)co 7255   ExId cexid 35929  Magmacmagm 35933
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fo 6424  df-fv 6426  df-ov 7258  df-exid 35930  df-mgmOLD 35934
This theorem is referenced by:  exidu1  35941
  Copyright terms: Public domain W3C validator