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 38199
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 38198 . . 3 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → (𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
5 oveq1 7374 . . . . . 6 (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
65eqeq1d 2738 . . . . 5 (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
76ovanraleqv 7391 . . . 4 (𝑢 = 𝑈 → (∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
87rspcev 3564 . . 3 ((𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)) → ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
94, 8syl 17 . 2 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
10 resexg 5992 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
113, 10eqeltrid 2840 . . . 4 (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
12 eqid 2736 . . . . 5 dom dom 𝐻 = dom dom 𝐻
1312isexid 38168 . . . 4 (𝐻 ∈ V → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
1411, 13syl 17 . . 3 (𝐺 ∈ (Magma ∩ ExId ) → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
15143ad2ant1 1134 . 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 1542  wcel 2114  wral 3051  wrex 3061  Vcvv 3429  cin 3888  wss 3889   × cxp 5629  dom cdm 5631  ran crn 5632  cres 5633  cfv 6498  (class class class)co 7367  GIdcgi 30561   ExId cexid 38165  Magmacmagm 38169
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 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fo 6504  df-fv 6506  df-riota 7324  df-ov 7370  df-gid 30565  df-exid 38166  df-mgmOLD 38170
This theorem is referenced by:  exidresid  38200
  Copyright terms: Public domain W3C validator