Theorem exidresid 38920

Description: Obsolete theorem, use idressid 18869 instead. 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.) (New usage is discouraged.) (Proof modification is discouraged.)

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.

Step	Hyp	Ref	Expression
1		exidres.3	. . . . . 6 ⊢ 𝐻 = (𝐺 ↾ (𝑌 × 𝑌))
2		resexg 6017	. . . . . 6 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
3	1, 2	eqeltrid 2864	. . . . 5 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
4		eqid 2760	. . . . . 6 ⊢ ran 𝐻 = ran 𝐻
5	4	gidval 31121	. . . . 5 ⊢ (𝐻 ∈ V → (GId‘𝐻) = (℩𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
6	3, 5	syl 18	. . . 4 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (GId‘𝐻) = (℩𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
7	6	3ad2ant1 1151	. . 3 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → (GId‘𝐻) = (℩𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
8	7	adantr 486	. 2 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → (GId‘𝐻) = (℩𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
9		exidres.1	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
10		exidres.2	. . . . . . 7 ⊢ 𝑈 = (GId‘𝐺)
11	9, 10, 1	exidreslem 38918	. . . . . 6 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → (𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
12	11	simprd 501	. . . . 5 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
13	12	adantr 486	. . . 4 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
14	9, 10, 1	exidres 38919	. . . . 5 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → 𝐻 ∈ ExId )
15		elin 4092	. . . . . . 7 ⊢ (𝐻 ∈ (Magma ∩ ExId ) ↔ (𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ))
16		rngopidOLD 38894	. . . . . . 7 ⊢ (𝐻 ∈ (Magma ∩ ExId ) → ran 𝐻 = dom dom 𝐻)
17	15, 16	sylbir 238	. . . . . 6 ⊢ ((𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ) → ran 𝐻 = dom dom 𝐻)
18	17	ancoms 464	. . . . 5 ⊢ ((𝐻 ∈ ExId ∧ 𝐻 ∈ Magma) → ran 𝐻 = dom dom 𝐻)
19	14, 18	sylan 592	. . . 4 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → ran 𝐻 = dom dom 𝐻)
20	13, 19	raleqtrrdv 3323	. . 3 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥))
21	11	simpld 500	. . . . . 6 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → 𝑈 ∈ dom dom 𝐻)
22	21	adantr 486	. . . . 5 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ dom dom 𝐻)
23	22, 19	eleqtrrd 2863	. . . 4 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → 𝑈 ∈ ran 𝐻)
24	4	exidu1 38897	. . . . . . 7 ⊢ (𝐻 ∈ (Magma ∩ ExId ) → ∃!𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
25	15, 24	sylbir 238	. . . . . 6 ⊢ ((𝐻 ∈ Magma ∧ 𝐻 ∈ ExId ) → ∃!𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
26	25	ancoms 464	. . . . 5 ⊢ ((𝐻 ∈ ExId ∧ 𝐻 ∈ Magma) → ∃!𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
27	14, 26	sylan 592	. . . 4 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → ∃!𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
28		oveq1 7429	. . . . . . 7 ⊢ (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
29	28	eqeq1d 2762	. . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
30	29	ovanraleqv 7446	. . . . 5 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
31	30	riota2 7404	. . . 4 ⊢ ((𝑈 ∈ ran 𝐻 ∧ ∃!𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) → (∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥) ↔ (℩𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈))
32	23, 27, 31	syl2anc 596	. . 3 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → (∀𝑥 ∈ ran 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥) ↔ (℩𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈))
33	20, 32	mpbid 235	. 2 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → (℩𝑢 ∈ ran 𝐻∀𝑥 ∈ ran 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)) = 𝑈)
34	8, 33	eqtrd 2795	1 ⊢ (((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) ∧ 𝐻 ∈ Magma) → (GId‘𝐻) = 𝑈)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃!wreu 3363  Vcvv 3450   ⊆ wss 3896   ∩ cin 4088   × cxp 5648  dom cdm 5650  ran crn 5651   ↾ cres 5652  ‘cfv 6541  ℩crio 7378  (class class class)co 7422  GIdcgi 31099   ExId cexid 38885  Magmacmagm 38889

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7753

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-fo 6547  df-fv 6549  df-riota 7379  df-ov 7425  df-gid 31103  df-exid 38886  df-mgmOLD 38890

This theorem is used by:  isdrngo2  38999