Theorem exidcl 38903

Description: Obsolete theorem, use mgmcl 18824 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 38880	. . . . . . . 8 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)
3	1, 2	eqtrid 2807	. . . . . . 7 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝑋 = dom dom 𝐺)
4	3	eleq2d 2846	. . . . . 6 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → (𝐴 ∈ 𝑋 ↔ 𝐴 ∈ dom dom 𝐺))
5	3	eleq2d 2846	. . . . . 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 4133	. . . . . . 7 ⊢ (Magma ∩ ExId ) ⊆ Magma
9	8	sseli 3904	. . . . . 6 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝐺 ∈ Magma)
10		eqid 2760	. . . . . . 7 ⊢ dom dom 𝐺 = dom dom 𝐺
11	10	clmgmOLD 38878	. . . . . 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 2863	1 ⊢ ((𝐺 ∈ (Magma ∩ ExId ) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ∩ cin 4089  dom cdm 5650  ran crn 5651  (class class class)co 7420   ExId cexid 38871  Magmacmagm 38875

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 7751

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-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  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-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546  df-ov 7423  df-exid 38872  df-mgmOLD 38876

This theorem is used by: (None)