Theorem rngopidOLD 38707

Description: Obsolete version of mgmidprnd 18819 as of 23-Jan-2020. Range of an operation with a left and right identity element. (Contributed by FL, 2-Nov-2009.) (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

Ref	Expression
rngopidOLD	⊢ (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)

Proof of Theorem rngopidOLD

Step	Hyp	Ref	Expression
1		eqid 2760	. . 3 ⊢ dom dom 𝐺 = dom dom 𝐺
2	1	opidonOLD 38706	. 2 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → 𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺)
3		forn 6787	. 2 ⊢ (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 → ran 𝐺 = dom dom 𝐺)
4	2, 3	syl 18	1 ⊢ (𝐺 ∈ (Magma ∩ ExId ) → ran 𝐺 = dom dom 𝐺)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ∩ cin 3897   × cxp 5645  dom cdm 5647  ran crn 5648  –onto→wfo 6525   ExId cexid 38698  Magmacmagm 38702

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 5248  ax-nul 5259  ax-pr 5390  ax-un 7734

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-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fo 6533  df-fv 6535  df-ov 7411  df-exid 38699  df-mgmOLD 38703

This theorem is used by:  isexid2  38709  ismndo2  38728  exidcl  38730  exidresid  38733