Theorem exidcl 38634

Description: Obsolete theorem, use mgmcl 18739 instead. Closure of the binary operation of a magma with identity. (Contributed by Jeff Madsen, 16-Jun-2011.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypothesis

Ref	Expression
exidcl.1	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
exidcl	⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)

Proof of Theorem exidcl

Step	Hyp	Ref	Expression
1		exidcl.1	. . . . . . . 8 ⊢ 𝑋 = ran 𝐺
2		rngopidOLD 38611	. . . . . . . 8 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)
3	1, 2	eqtrid 2809	. . . . . . 7 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝑋 = dom dom 𝐺)
4	3	eleq2d 2848	. . . . . 6 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (𝐴 ∈ 𝑋 ↔ 𝐴 ∈ dom dom 𝐺))
5	3	eleq2d 2848	. . . . . 6 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (𝐵 ∈ 𝑋 ↔ 𝐵 ∈ dom dom 𝐺))
6	4, 5	anbi12d 644	. . . . 5 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ↔ (𝐴 ∈ dom dom 𝐺 ∧ 𝐵 ∈ dom dom 𝐺)))
7	6	pm5.32i 585	. . . 4 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ↔ (𝐺 ∈ (Magma ∩ ExId ) ∧ (𝐴 ∈ dom dom 𝐺 ∧ 𝐵 ∈ dom dom 𝐺)))
8		inss1 4185	. . . . . . 7 ⊢ (Magma ∩ ExId ) ⊆ Magma
9	8	sseli 3930	. . . . . 6 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝐺 ∈ Magma)
10		eqid 2762	. . . . . . 7 ⊢ dom dom 𝐺 = dom dom 𝐺
11	10	clmgmOLD 38609	. . . . . 6 ⊢ ((𝐺 ∈ Magma ∧ 𝐴 ∈ dom dom 𝐺 ∧ 𝐵 ∈ dom dom 𝐺) → (𝐴𝐺𝐵) ∈ dom dom 𝐺)
12	9, 11	syl3an1 1181	. . . . 5 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝐴 ∈ dom dom 𝐺 ∧ 𝐵 ∈ dom dom 𝐺) → (𝐴𝐺𝐵) ∈ dom dom 𝐺)
13	12	3expb 1138	. . . 4 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ (𝐴 ∈ dom dom 𝐺 ∧ 𝐵 ∈ dom dom 𝐺)) → (𝐴𝐺𝐵) ∈ dom dom 𝐺)
14	7, 13	sylbi 220	. . 3 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐺𝐵) ∈ dom dom 𝐺)
15	14	3impb 1132	. 2 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ dom dom 𝐺)
16	3	3ad2ant1 1151	. 2 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝑋 = dom dom 𝐺)
17	15, 16	eleqtrrd 2865	1 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ∩ cin 3901  dom cdm 5659  ran crn 5660  (class class class)co 7417   ExId cexid 38602  Magmacmagm 38606

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-ov 7420  df-exid 38603  df-mgmOLD 38607

This theorem is used by: (None)