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

Theorem exidres 37991
Description: The restriction of a binary operation with identity to a subset containing the identity has an 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
exidres ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝐻 ∈ ExId )

Proof of Theorem exidres
Dummy variables 𝑥 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 exidres.1 . . . 4 𝑋 = ran 𝐺
2 exidres.2 . . . 4 𝑈 = (GId‘𝐺)
3 exidres.3 . . . 4 𝐻 = (𝐺 ↾ (𝑌 × 𝑌))
41, 2, 3exidreslem 37990 . . 3 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → (𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
5 oveq1 7362 . . . . . 6 (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
65eqeq1d 2735 . . . . 5 (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
76ovanraleqv 7379 . . . 4 (𝑢 = 𝑈 → (∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
87rspcev 3573 . . 3 ((𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)) → ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
94, 8syl 17 . 2 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
10 resexg 5983 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
113, 10eqeltrid 2837 . . . 4 (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
12 eqid 2733 . . . . 5 dom dom 𝐻 = dom dom 𝐻
1312isexid 37960 . . . 4 (𝐻 ∈ V → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
1411, 13syl 17 . . 3 (𝐺 ∈ (Magma ∩ ExId ) → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
15143ad2ant1 1133 . 2 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
169, 15mpbird 257 1 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝐻 ∈ ExId )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3048  wrex 3057  Vcvv 3437  cin 3897  wss 3898   × cxp 5619  dom cdm 5621  ran crn 5622  cres 5623  cfv 6489  (class class class)co 7355  GIdcgi 30491   ExId cexid 37957  Magmacmagm 37961
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 5238  ax-nul 5248  ax-pr 5374  ax-un 7677
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 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-fo 6495  df-fv 6497  df-riota 7312  df-ov 7358  df-gid 30495  df-exid 37958  df-mgmOLD 37962
This theorem is referenced by:  exidresid  37992
  Copyright terms: Public domain W3C validator