Theorem rngmgmbs4 38435

Description: The range of an internal operation with a left and right identity element equals its base set. (Contributed by FL, 24-Jan-2010.) (Revised by Mario Carneiro, 22-Dec-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
rngmgmbs4	⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → ran 𝐺 = 𝑋)

Distinct variable groups:   𝑢,𝐺,𝑥   𝑢,𝑋,𝑥

Proof of Theorem rngmgmbs4

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		r19.12 3313	. . . . 5 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥))
2		simpl 486	. . . . . . . . 9 ⊢ (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → (𝑢𝐺𝑥) = 𝑥)
3	2	eqcomd 2770	. . . . . . . 8 ⊢ (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → 𝑥 = (𝑢𝐺𝑥))
4		oveq2 7406	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑢𝐺𝑦) = (𝑢𝐺𝑥))
5	4	rspceeqv 3606	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 = (𝑢𝐺𝑥)) → ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))
6	5	ex 416	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → (𝑥 = (𝑢𝐺𝑥) → ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)))
7	3, 6	syl5 34	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → (((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)))
8	7	reximdv 3179	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → (∃𝑢 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)))
9	8	ralimia 3098	. . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))
10	1, 9	syl 17	. . . 4 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦))
11	10	anim2i 626	. . 3 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)))
12		foov 7572	. . 3 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ∃𝑦 ∈ 𝑋 𝑥 = (𝑢𝐺𝑦)))
13	11, 12	sylibr 236	. 2 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → 𝐺:(𝑋 × 𝑋)–onto→𝑋)
14		forn 6783	. 2 ⊢ (𝐺:(𝑋 × 𝑋)–onto→𝑋 → ran 𝐺 = 𝑋)
15	13, 14	syl 17	1 ⊢ ((𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ (𝑥𝐺𝑢) = 𝑥)) → ran 𝐺 = 𝑋)

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1562   ∈ wcel 2144  ∀wral 3078  ∃wrex 3088   × cxp 5647  ran crn 5650  ⟶wf 6519  –onto→wfo 6521  (class class class)co 7398

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-fo 6529  df-fv 6531  df-ov 7401

This theorem is referenced by:  rngorn1eq  38438