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 38194
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 38192 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)
3 elin 3906 . . . . . . 7 (𝐺 ∈ (Magma ∩ ExId ) ↔ (𝐺 ∈ Magma ∧ 𝐺 ∈ ExId ))
4 eqid 2737 . . . . . . . . . . 11 dom dom 𝐺 = dom dom 𝐺
54isexid 38186 . . . . . . . . . 10 (𝐺 ∈ ExId → (𝐺 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
65ibi 267 . . . . . . . . 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 217 . . . . . 6 (𝐺 ∈ (Magma ∩ ExId ) → (𝑋 = dom dom 𝐺 → ∃𝑢 ∈ dom dom 𝐺𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
10 eqeq2 2749 . . . . . . 7 (ran 𝐺 = dom dom 𝐺 → (𝑋 = ran 𝐺𝑋 = dom dom 𝐺))
11 raleq 3293 . . . . . . . 8 (ran 𝐺 = dom dom 𝐺 → (∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1211rexeqbi1dv 3307 . . . . . . 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, 13imbitrrid 246 . . . . 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 3293 . . . 4 (𝑋 = ran 𝐺 → (∀𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1817rexeqbi1dv 3307 . . 3 (𝑋 = ran 𝐺 → (∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) ↔ ∃𝑢 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
1916, 18sylibrd 259 . 2 (𝑋 = ran 𝐺 → (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)))
201, 19ax-mp 5 1 (𝐺 ∈ (Magma ∩ ExId ) → ∃𝑢𝑋𝑥𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3062  cin 3889  dom cdm 5626  ran crn 5627  (class class class)co 7362   ExId cexid 38183  Magmacmagm 38187
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5372  ax-un 7684
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-fo 6500  df-fv 6502  df-ov 7365  df-exid 38184  df-mgmOLD 38188
This theorem is referenced by:  exidu1  38195
  Copyright terms: Public domain W3C validator