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 37873
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 5998 . . . . . 6 (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
31, 2eqeltrid 2832 . . . . 5 (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
4 eqid 2729 . . . . . 6 ran 𝐻 = ran 𝐻
54gidval 30441 . . . . 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 37871 . . . . . 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 37872 . . . . 5 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝐻 ∈ ExId )
15 elin 3930 . . . . . . 7 (𝐻 ∈ (Magma ∩ ExId ) ↔ (𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ))
16 rngopidOLD 37847 . . . . . . 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 3303 . . 3 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
2111simpld 494 . . . . . 6 ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) → 𝑈 ∈ dom dom 𝐻)
2221adantr 480 . . . . 5 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ dom dom 𝐻)
2322, 19eleqtrrd 2831 . . . 4 (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌𝑋𝑈𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ ran 𝐻)
244exidu1 37850 . . . . . . 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 7394 . . . . . . 7 (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
2928eqeq1d 2731 . . . . . 6 (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
3029ovanraleqv 7411 . . . . 5 (𝑢 = 𝑈 → (∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
3130riota2 7369 . . . 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 2764 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 3044  ∃!wreu 3352  Vcvv 3447  cin 3913  wss 3914   × cxp 5636  dom cdm 5638  ran crn 5639  cres 5640  cfv 6511  crio 7343  (class class class)co 7387  GIdcgi 30419   ExId cexid 37838  Magmacmagm 37842
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 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711
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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fo 6517  df-fv 6519  df-riota 7344  df-ov 7390  df-gid 30423  df-exid 37839  df-mgmOLD 37843
This theorem is referenced by:  isdrngo2  37952
  Copyright terms: Public domain W3C validator