Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  opidon2OLD Structured version   Visualization version   GIF version

Theorem opidon2OLD 38768
Description: Obsolete version of mgmfod 18852 as of 23-Jan-2020. An operation with a left and right identity element is onto. (Contributed by FL, 2-Nov-2009.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
opidon2OLD.1 𝑋 = ran 𝐺
Assertion
Ref Expression
opidon2OLD (𝐺 ∈ (Magma ∩ ExId ) → 𝐺:(𝑋 × 𝑋)–onto→𝑋)

Proof of Theorem opidon2OLD
StepHypRef Expression
1 eqid 2761 . . 3 dom dom 𝐺 = dom dom 𝐺
21opidonOLD 38766 . 2 (𝐺 ∈ (Magma ∩ ExId ) → 𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺)
3 opidon2OLD.1 . . . 4 𝑋 = ran 𝐺
4 forn 6797 . . . 4 (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 → ran 𝐺 = dom dom 𝐺)
53, 4eqtr2id 2809 . . 3 (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 → dom dom 𝐺 = 𝑋)
6 xpeq12 5676 . . . . . . 7 ((dom dom 𝐺 = 𝑋 ∧ dom dom 𝐺 = 𝑋) → (dom dom 𝐺 × dom dom 𝐺) = (𝑋 × 𝑋))
76anidms 577 . . . . . 6 (dom dom 𝐺 = 𝑋 → (dom dom 𝐺 × dom dom 𝐺) = (𝑋 × 𝑋))
8 foeq2 6791 . . . . . 6 ((dom dom 𝐺 × dom dom 𝐺) = (𝑋 × 𝑋) → (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 ↔ 𝐺:(𝑋 × 𝑋)–onto→dom dom 𝐺))
97, 8syl 18 . . . . 5 (dom dom 𝐺 = 𝑋 → (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 ↔ 𝐺:(𝑋 × 𝑋)–onto→dom dom 𝐺))
10 foeq3 6792 . . . . 5 (dom dom 𝐺 = 𝑋 → (𝐺:(𝑋 × 𝑋)–onto→dom dom 𝐺 ↔ 𝐺:(𝑋 × 𝑋)–onto→𝑋))
119, 10bitrd 282 . . . 4 (dom dom 𝐺 = 𝑋 → (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 ↔ 𝐺:(𝑋 × 𝑋)–onto→𝑋))
1211biimpd 232 . . 3 (dom dom 𝐺 = 𝑋 → (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 → 𝐺:(𝑋 × 𝑋)–onto→𝑋))
135, 12mpcom 39 . 2 (𝐺:(dom dom 𝐺 × dom dom 𝐺)–onto→dom dom 𝐺 → 𝐺:(𝑋 × 𝑋)–onto→𝑋)
142, 13syl 18 1 (𝐺 ∈ (Magma ∩ ExId ) → 𝐺:(𝑋 × 𝑋)–onto→𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145   ∩ cin 3898   × cxp 5649  dom cdm 5651  ran crn 5652  –onto→wfo 6535   ExId cexid 38758  Magmacmagm 38762
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-ov 7421  df-exid 38759  df-mgmOLD 38763
This theorem is used by:  exidreslem  38791
  Copyright terms: Public domain W3C validator