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 38534
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 38532 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)
3 elin 3920 . . . . . . 7 (𝐺 ∈ (Magma ∩ ExId ) ↔ (𝐺 ∈ Magma ∧ 𝐺 ∈ ExId ))
4 eqid 2762 . . . . . . . . . . 11 dom dom 𝐺 = dom dom 𝐺
54isexid 38526 . . . . . . . . . 10 (𝐺 ∈ ExId → (𝐺 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
65ibi 270 . . . . . . . . 9 (𝐺 ∈ ExId → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
76a1d 26 . . . . . . . 8 (𝐺 ∈ ExId → (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
87adantl 486 . . . . . . 7 ((𝐺 ∈ Magma ∧ 𝐺 ∈ ExId ) → (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
93, 8sylbi 220 . . . . . 6 (𝐺 ∈ (Magma ∩ ExId ) → (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
10 eqeq2 2774 . . . . . . 7 (ran 𝐺 = dom dom 𝐺 → (𝑋 = ran 𝐺𝑋 = dom dom 𝐺))
11 raleq 3319 . . . . . . . 8 (ran 𝐺 = dom dom 𝐺 → (∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1211rexeqbi1dv 3333 . . . . . . 7 (ran 𝐺 = dom dom 𝐺 → (∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1310, 12imbi12d 347 . . . . . 6 (ran 𝐺 = dom dom 𝐺 → ((𝑋 = ran 𝐺 → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) ↔ (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))))
149, 13imbitrrid 249 . . . . 5 (ran 𝐺 = dom dom 𝐺 → (𝐺 ∈ (Magma ∩ ExId ) → (𝑋 = ran 𝐺 → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))))
152, 14mpcom 39 . . . 4 (𝐺 ∈ (Magma ∩ ExId ) → (𝑋 = ran 𝐺 → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1615com12 33 . . 3 (𝑋 = ran 𝐺 → (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
17 raleq 3319 . . . 4 (𝑋 = ran 𝐺 → (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1817rexeqbi1dv 3333 . . 3 (𝑋 = ran 𝐺 → (∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1916, 18sylibrd 262 . 2 (𝑋 = ran 𝐺 → (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
201, 19ax-mp 5 1 (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1569  wcel 2142  wral 3078  wrex 3088  cin 3903  dom cdm 5660  ran crn 5661  (class class class)co 7412   ExId cexid 38523  Magmacmagm 38527
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fo 6542  df-fv 6544  df-ov 7415  df-exid 38524  df-mgmOLD 38528
This theorem is used by:  exidu1  38535
  Copyright terms: Public domain W3C validator