Theorem exidres 38629

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

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.

Step	Hyp	Ref	Expression
1		exidres.1	. . . 4 ⊢ 𝑋 = ran 𝐺
2		exidres.2	. . . 4 ⊢ 𝑈 = (GId‘𝐺)
3		exidres.3	. . . 4 ⊢ 𝐻 = (𝐺 ↾ (𝑌 × 𝑌))
4	1, 2, 3	exidreslem 38628	. . 3 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → (𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
5		oveq1 7421	. . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
6	5	eqeq1d 2762	. . . . 5 ⊢ (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
7	6	ovanraleqv 7438	. . . 4 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
8	7	rspcev 3576	. . 3 ⊢ ((𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)) → ∃𝑢 ∈ dom dom 𝐻∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
9	4, 8	syl 18	. 2 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → ∃𝑢 ∈ dom dom 𝐻∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
10		resexg 6020	. . . . 5 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
11	3, 10	eqeltrid 2864	. . . 4 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
12		eqid 2760	. . . . 5 ⊢ dom dom 𝐻 = dom dom 𝐻
13	12	isexid 38598	. . . 4 ⊢ (𝐻 ∈ V → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
14	11, 13	syl 18	. . 3 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
15	14	3ad2ant1 1151	. 2 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → (𝐻 ∈ ExId ↔ ∃𝑢 ∈ dom dom 𝐻∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥)))
16	9, 15	mpbird 260	1 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → 𝐻 ∈ ExId )

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899   × cxp 5653  dom cdm 5655  ran crn 5656   ↾ cres 5657  ‘cfv 6533  (class class class)co 7414  GIdcgi 30972   ExId cexid 38595  Magmacmagm 38599

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-riota 7371  df-ov 7417  df-gid 30976  df-exid 38596  df-mgmOLD 38600

This theorem is used by:  exidresid  38630