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 37838
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 37837 . . 3 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → (𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
5 oveq1 7455 . . . . . 6 (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
65eqeq1d 2742 . . . . 5 (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
76ovanraleqv 7472 . . . 4 (𝑢 = 𝑈 → (∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
87rspcev 3635 . . 3 ((𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)) → ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
94, 8syl 17 . 2 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
10 resexg 6056 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
113, 10eqeltrid 2848 . . . 4 (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
12 eqid 2740 . . . . 5 dom dom 𝐻 = dom dom 𝐻
1312isexid 37807 . . . 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 1087   = wceq 1537  wcel 2108  wral 3067  wrex 3076  Vcvv 3488  cin 3975  wss 3976   × cxp 5698  dom cdm 5700  ran crn 5701  cres 5702  cfv 6573  (class class class)co 7448  GIdcgi 30522   ExId cexid 37804  Magmacmagm 37808
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fo 6579  df-fv 6581  df-riota 7404  df-ov 7451  df-gid 30526  df-exid 37805  df-mgmOLD 37809
This theorem is referenced by:  exidresid  37839
  Copyright terms: Public domain W3C validator