Theorem mgmidpfod 18850

Description: The operation of a magma with identity as a function is an onto function. (Contributed by FL, 2-Nov-2009.) (Revised by Mario Carneiro, 22-Dec-2013.) (Revised by AV, 16-Aug-2026.)

Hypotheses

Ref	Expression
mgmidpfod.b	⊢ 𝐵 = (Base‘𝐺)
mgmidpfod.p	⊢ + = (+g‘𝐺)
mgmidpfod.g	⊢ (𝜑 → 𝐺 ∈ Mgm)
mgmidpfod.e	⊢ (𝜑 → ∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
mgmidpfod.f	⊢ ⨣ = (+𝑓‘𝐺)

Assertion

Ref	Expression
mgmidpfod	⊢ (𝜑 → ⨣ :(𝐵 × 𝐵)–onto→𝐵)

Distinct variable groups:   𝐵,𝑒,𝑥   𝜑,𝑒,𝑥   ⨣ ,𝑒,𝑥

Allowed substitution hints:   + (𝑥, 𝑒)   𝐺(𝑥, 𝑒)

Proof of Theorem mgmidpfod

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mgmidpfod.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ Mgm)
2		mgmidpfod.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
3		mgmidpfod.f	. . . 4 ⊢ ⨣ = (+𝑓‘𝐺)
4	2, 3	mgmplusf 18819	. . 3 ⊢ (𝐺 ∈ Mgm → ⨣ :(𝐵 × 𝐵)⟶𝐵)
5	1, 4	syl 18	. 2 ⊢ (𝜑 → ⨣ :(𝐵 × 𝐵)⟶𝐵)
6		mgmidpfod.e	. . . 4 ⊢ (𝜑 → ∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
7		mgmidpfod.p	. . . . . . . . . 10 ⊢ + = (+g‘𝐺)
8	2, 7, 3	plusfval 18816	. . . . . . . . 9 ⊢ ((𝑒 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑒 ⨣ 𝑥) = (𝑒 + 𝑥))
9	8	adantll 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑒 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑒 ⨣ 𝑥) = (𝑒 + 𝑥))
10	9	eqeq1d 2763	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑒 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑒 ⨣ 𝑥) = 𝑥 ↔ (𝑒 + 𝑥) = 𝑥))
11	10	anbi1d 643	. . . . . 6 ⊢ (((𝜑 ∧ 𝑒 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → (((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
12	11	ralbidva 3184	. . . . 5 ⊢ ((𝜑 ∧ 𝑒 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∀𝑥 ∈ 𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
13	12	rexbidva 3185	. . . 4 ⊢ (𝜑 → (∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ↔ ∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥)))
14	6, 13	mpbird 260	. . 3 ⊢ (𝜑 → ∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥))
15		simpl 488	. . . . . . . 8 ⊢ (((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → (𝑒 ⨣ 𝑥) = 𝑥)
16	15	ralimi 3100	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → ∀𝑥 ∈ 𝐵 (𝑒 ⨣ 𝑥) = 𝑥)
17		oveq2 7426	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑒 ⨣ 𝑥) = (𝑒 ⨣ 𝑦))
18		id 23	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
19	17, 18	eqeq12d 2777	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((𝑒 ⨣ 𝑥) = 𝑥 ↔ (𝑒 ⨣ 𝑦) = 𝑦))
20	19	rspcv 3573	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑒 ⨣ 𝑥) = 𝑥 → (𝑒 ⨣ 𝑦) = 𝑦))
21		eqcom 2768	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑒 ⨣ 𝑥) ↔ (𝑒 ⨣ 𝑥) = 𝑦)
22	17	eqeq1d 2763	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → ((𝑒 ⨣ 𝑥) = 𝑦 ↔ (𝑒 ⨣ 𝑦) = 𝑦))
23	21, 22	bitrid 286	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑦 = (𝑒 ⨣ 𝑥) ↔ (𝑒 ⨣ 𝑦) = 𝑦))
24	23	rspcev 3577	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐵 ∧ (𝑒 ⨣ 𝑦) = 𝑦) → ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥))
25	24	ex 418	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → ((𝑒 ⨣ 𝑦) = 𝑦 → ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥)))
26	20, 25	syld 48	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑒 ⨣ 𝑥) = 𝑥 → ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥)))
27	16, 26	syl5 35	. . . . . 6 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥)))
28	27	reximdv 3178	. . . . 5 ⊢ (𝑦 ∈ 𝐵 → (∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → ∃𝑒 ∈ 𝐵 ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥)))
29	28	impcom 413	. . . 4 ⊢ ((∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) ∧ 𝑦 ∈ 𝐵) → ∃𝑒 ∈ 𝐵 ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥))
30	29	ralrimiva 3155	. . 3 ⊢ (∃𝑒 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑒 ⨣ 𝑥) = 𝑥 ∧ (𝑥 + 𝑒) = 𝑥) → ∀𝑦 ∈ 𝐵 ∃𝑒 ∈ 𝐵 ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥))
31	14, 30	syl 18	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∃𝑒 ∈ 𝐵 ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥))
32		foov 7593	. 2 ⊢ ( ⨣ :(𝐵 × 𝐵)–onto→𝐵 ↔ ( ⨣ :(𝐵 × 𝐵)⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑒 ∈ 𝐵 ∃𝑥 ∈ 𝐵 𝑦 = (𝑒 ⨣ 𝑥)))
33	5, 31, 32	sylanbrc 595	1 ⊢ (𝜑 → ⨣ :(𝐵 × 𝐵)–onto→𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   × cxp 5649  ⟶wf 6533  –onto→wfo 6535  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +_gcplusg 17421  +_𝑓cplusf 18806  Mgmcmgm 18807

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-pow 5327  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-pw 4559  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-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-plusf 18808  df-mgm 18809

This theorem is used by:  mgmidprnd  18851  mgmfod  18852  mndpfo  18940