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

Theorem exidresid 38214
Description: The restriction of a binary operation with identity to a subset containing the identity has the same identity element. (Contributed by Jeff Madsen, 8-Jun-2010.) (Revised by Mario Carneiro, 23-Dec-2013.)
Hypotheses
Ref Expression
exidres.1 𝑋 = ran 𝐺
exidres.2 𝑈 = (GId‘𝐺)
exidres.3 𝐻 = (𝐺 ↾ (𝑌 × 𝑌))
Assertion
Ref Expression
exidresid (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (GId‘𝐻) = 𝑈)

Proof of Theorem exidresid
Dummy variables 𝑥 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 exidres.3 . . . . . 6 𝐻 = (𝐺 ↾ (𝑌 × 𝑌))
2 resexg 5986 . . . . . 6 (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
31, 2eqeltrid 2841 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
4 eqid 2737 . . . . . 6 ran 𝐻 = ran 𝐻
54gidval 30598 . . . . 5 (𝐻 ∈ V → (GId‘𝐻) = (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
63, 5syl 17 . . . 4 (𝐺 ∈ (Magma ∩ ExId ) → (GId‘𝐻) = (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
763ad2ant1 1134 . . 3 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → (GId‘𝐻) = (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
87adantr 480 . 2 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (GId‘𝐻) = (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
9 exidres.1 . . . . . . 7 𝑋 = ran 𝐺
10 exidres.2 . . . . . . 7 𝑈 = (GId‘𝐺)
119, 10, 1exidreslem 38212 . . . . . 6 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → (𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
1211simprd 495 . . . . 5 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
1312adantr 480 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
149, 10, 1exidres 38213 . . . . 5 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝐻 ∈ ExId )
15 elin 3906 . . . . . . 7 (𝐻 ∈ (Magma ∩ ExId ) ↔ (𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ))
16 rngopidOLD 38188 . . . . . . 7 (𝐻 ∈ (Magma ∩ ExId ) → ran 𝐻 = dom dom 𝐻)
1715, 16sylbir 235 . . . . . 6 ((𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ) → ran 𝐻 = dom dom 𝐻)
1817ancoms 458 . . . . 5 ((𝐻 ∈ ExId ∧ 𝐻 ∈ Magma) → ran 𝐻 = dom dom 𝐻)
1914, 18sylan 581 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ran 𝐻 = dom dom 𝐻)
2013, 19raleqtrrdv 3300 . . 3 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
2111simpld 494 . . . . . 6 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝑈 ∈ dom dom 𝐻)
2221adantr 480 . . . . 5 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ dom dom 𝐻)
2322, 19eleqtrrd 2840 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ ran 𝐻)
244exidu1 38191 . . . . . . 7 (𝐻 ∈ (Magma ∩ ExId ) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
2515, 24sylbir 235 . . . . . 6 ((𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
2625ancoms 458 . . . . 5 ((𝐻 ∈ ExId ∧ 𝐻 ∈ Magma) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
2714, 26sylan 581 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
28 oveq1 7367 . . . . . . 7 (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
2928eqeq1d 2739 . . . . . 6 (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
3029ovanraleqv 7384 . . . . 5 (𝑢 = 𝑈 → (∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
3130riota2 7342 . . . 4 ((𝑈 ∈ ran 𝐻 ∧ ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) → (∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥) ↔ (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈))
3223, 27, 31syl2anc 585 . . 3 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥) ↔ (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈))
3320, 32mpbid 232 . 2 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈)
348, 33eqtrd 2772 1 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (GId‘𝐻) = 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  ∃!wreu 3341  Vcvv 3430  cin 3889  wss 3890   × cxp 5622  dom cdm 5624  ran crn 5625  cres 5626  cfv 6492  crio 7316  (class class class)co 7360  GIdcgi 30576   ExId cexid 38179  Magmacmagm 38183
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 5231  ax-nul 5241  ax-pr 5370  ax-un 7682
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-rmo 3343  df-reu 3344  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 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fo 6498  df-fv 6500  df-riota 7317  df-ov 7363  df-gid 30580  df-exid 38180  df-mgmOLD 38184
This theorem is referenced by:  isdrngo2  38293
  Copyright terms: Public domain W3C validator