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 37908
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 6019 . . . . . 6 (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
31, 2eqeltrid 2839 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
4 eqid 2736 . . . . . 6 ran 𝐻 = ran 𝐻
54gidval 30498 . . . . 5 (𝐻 ∈ V → (GId‘𝐻) = (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
63, 5syl 17 . . . 4 (𝐺 ∈ (Magma ∩ ExId ) → (GId‘𝐻) = (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
763ad2ant1 1133 . . 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 37906 . . . . . 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 37907 . . . . 5 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝐻 ∈ ExId )
15 elin 3947 . . . . . . 7 (𝐻 ∈ (Magma ∩ ExId ) ↔ (𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ))
16 rngopidOLD 37882 . . . . . . 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 580 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ran 𝐻 = dom dom 𝐻)
2013, 19raleqtrrdv 3313 . . 3 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
2111simpld 494 . . . . . 6 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝑈 ∈ dom dom 𝐻)
2221adantr 480 . . . . 5 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ dom dom 𝐻)
2322, 19eleqtrrd 2838 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ ran 𝐻)
244exidu1 37885 . . . . . . 7 (𝐻 ∈ (Magma ∩ ExId ) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
2515, 24sylbir 235 . . . . . 6 ((𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
2625ancoms 458 . . . . 5 ((𝐻 ∈ ExId ∧ 𝐻 ∈ Magma) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
2714, 26sylan 580 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
28 oveq1 7417 . . . . . . 7 (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
2928eqeq1d 2738 . . . . . 6 (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
3029ovanraleqv 7434 . . . . 5 (𝑢 = 𝑈 → (∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
3130riota2 7392 . . . 4 ((𝑈 ∈ ran 𝐻 ∧ ∃!𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) → (∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥) ↔ (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈))
3223, 27, 31syl2anc 584 . . 3 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥) ↔ (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈))
3320, 32mpbid 232 . 2 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (𝑢 ∈ ran 𝐻𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈)
348, 33eqtrd 2771 1 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (GId‘𝐻) = 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3052  ∃!wreu 3362  Vcvv 3464  cin 3930  wss 3931   × cxp 5657  dom cdm 5659  ran crn 5660  cres 5661  cfv 6536  crio 7366  (class class class)co 7410  GIdcgi 30476   ExId cexid 37873  Magmacmagm 37877
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407  ax-un 7734
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-fo 6542  df-fv 6544  df-riota 7367  df-ov 7413  df-gid 30480  df-exid 37874  df-mgmOLD 37878
This theorem is referenced by:  isdrngo2  37987
  Copyright terms: Public domain W3C validator