Theorem exidres 38952

Description: Obsolete theorem, use idressidex 18873 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 38951	. . 3 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → (𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
5		oveq1 7434	. . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢𝐻𝑥) = (𝑈𝐻𝑥))
6	5	eqeq1d 2765	. . . . 5 ⊢ (𝑢 = 𝑈 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑈𝐻𝑥) = 𝑥))
7	6	ovanraleqv 7451	. . . 4 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)))
8	7	rspcev 3579	. . 3 ⊢ ((𝑈 ∈ dom dom 𝐻 ∧ ∀𝑥 ∈ dom dom 𝐻((𝑈𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑈) = 𝑥)) → ∃𝑢 ∈ dom dom 𝐻∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
9	4, 8	syl 18	. 2 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝑌 ⊆ 𝑋 ∧ 𝑈 ∈ 𝑌) → ∃𝑢 ∈ dom dom 𝐻∀𝑥 ∈ dom dom 𝐻((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
10		resexg 6021	. . . . 5 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (𝐺 ↾ (𝑌 × 𝑌)) ∈ V)
11	3, 10	eqeltrid 2867	. . . 4 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝐻 ∈ V)
12		eqid 2763	. . . . 5 ⊢ dom dom 𝐻 = dom dom 𝐻
13	12	isexid 38921	. . . 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 1569   ∈ wcel 2146  ∀wral 3079  ∃wrex 3089  Vcvv 3453   ⊆ wss 3899   ∩ cin 4091   × cxp 5652  dom cdm 5654  ran crn 5655   ↾ cres 5656  ‘cfv 6546  (class class class)co 7427  GIdcgi 31104   ExId cexid 38918  Magmacmagm 38922

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pr 5394  ax-un 7758

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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fo 6552  df-fv 6554  df-riota 7384  df-ov 7430  df-gid 31108  df-exid 38919  df-mgmOLD 38923

This theorem is used by:  exidresid  38953