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 37939
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 5980 . . . . . 6 (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
31, 2eqeltrid 2837 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
4 eqid 2733 . . . . . 6 ran 𝐻 = ran 𝐻
54gidval 30494 . . . . 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 37937 . . . . . 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 37938 . . . . 5 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝐻 ∈ ExId )
15 elin 3914 . . . . . . 7 (𝐻 ∈ (Magma ∩ ExId ) ↔ (𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ))
16 rngopidOLD 37913 . . . . . . 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 3297 . . 3 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
2111simpld 494 . . . . . 6 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝑈 ∈ dom dom 𝐻)
2221adantr 480 . . . . 5 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ dom dom 𝐻)
2322, 19eleqtrrd 2836 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ ran 𝐻)
244exidu1 37916 . . . . . . 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 7359 . . . . . . 7 (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
2928eqeq1d 2735 . . . . . 6 (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
3029ovanraleqv 7376 . . . . 5 (𝑢 = 𝑈 → (∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
3130riota2 7334 . . . 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 2768 1 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → (GId‘𝐻) = 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3048  ∃!wreu 3345  Vcvv 3437  cin 3897  wss 3898   × cxp 5617  dom cdm 5619  ran crn 5620  cres 5621  cfv 6486  crio 7308  (class class class)co 7352  GIdcgi 30472   ExId cexid 37904  Magmacmagm 37908
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pr 5372  ax-un 7674
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-fo 6492  df-fv 6494  df-riota 7309  df-ov 7355  df-gid 30476  df-exid 37905  df-mgmOLD 37909
This theorem is referenced by:  isdrngo2  38018
  Copyright terms: Public domain W3C validator