Theorem pgrpgt2nabl 44407

Description: Every symmetric group on a set with more than 2 elements is not abelian, see also the remark in [Rotman] p. 28. (Contributed by AV, 21-Mar-2019.)

Hypothesis

Ref	Expression
pgrple2abl.g	⊢ 𝐺 = (SymGrp‘𝐴)

Assertion

Ref	Expression
pgrpgt2nabl	⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → 𝐺 ∉ Abel)

Proof of Theorem pgrpgt2nabl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2821	. . . . . . . 8 ⊢ ran (pmTrsp‘𝐴) = ran (pmTrsp‘𝐴)
2		pgrple2abl.g	. . . . . . . 8 ⊢ 𝐺 = (SymGrp‘𝐴)
3		eqid 2821	. . . . . . . 8 ⊢ (Base‘𝐺) = (Base‘𝐺)
4	1, 2, 3	symgtrf 18591	. . . . . . 7 ⊢ ran (pmTrsp‘𝐴) ⊆ (Base‘𝐺)
5		hashcl 13711	. . . . . . . . . . 11 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0)
6		2nn0 11908	. . . . . . . . . . . . . . 15 ⊢ 2 ∈ ℕ0
7		nn0ltp1le 12034	. . . . . . . . . . . . . . 15 ⊢ ((2 ∈ ℕ0 ∧ (♯‘𝐴) ∈ ℕ0) → (2 < (♯‘𝐴) ↔ (2 + 1) ≤ (♯‘𝐴)))
8	6, 7	mpan 688	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝐴) ∈ ℕ0 → (2 < (♯‘𝐴) ↔ (2 + 1) ≤ (♯‘𝐴)))
9		2p1e3 11773	. . . . . . . . . . . . . . . 16 ⊢ (2 + 1) = 3
10	9	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐴) ∈ ℕ0 → (2 + 1) = 3)
11	10	breq1d 5069	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝐴) ∈ ℕ0 → ((2 + 1) ≤ (♯‘𝐴) ↔ 3 ≤ (♯‘𝐴)))
12	8, 11	bitrd 281	. . . . . . . . . . . . 13 ⊢ ((♯‘𝐴) ∈ ℕ0 → (2 < (♯‘𝐴) ↔ 3 ≤ (♯‘𝐴)))
13	12	biimpd 231	. . . . . . . . . . . 12 ⊢ ((♯‘𝐴) ∈ ℕ0 → (2 < (♯‘𝐴) → 3 ≤ (♯‘𝐴)))
14	13	adantld 493	. . . . . . . . . . 11 ⊢ ((♯‘𝐴) ∈ ℕ0 → ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → 3 ≤ (♯‘𝐴)))
15	5, 14	syl 17	. . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → 3 ≤ (♯‘𝐴)))
16		3re 11711	. . . . . . . . . . . . . . . 16 ⊢ 3 ∈ ℝ
17	16	rexri 10693	. . . . . . . . . . . . . . 15 ⊢ 3 ∈ ℝ*
18		pnfge 12519	. . . . . . . . . . . . . . 15 ⊢ (3 ∈ ℝ* → 3 ≤ +∞)
19	17, 18	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ 3 ≤ +∞
20		hashinf 13689	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (♯‘𝐴) = +∞)
21	19, 20	breqtrrid 5097	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → 3 ≤ (♯‘𝐴))
22	21	ex 415	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → (¬ 𝐴 ∈ Fin → 3 ≤ (♯‘𝐴)))
23	22	adantr 483	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → (¬ 𝐴 ∈ Fin → 3 ≤ (♯‘𝐴)))
24	23	com12 32	. . . . . . . . . 10 ⊢ (¬ 𝐴 ∈ Fin → ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → 3 ≤ (♯‘𝐴)))
25	15, 24	pm2.61i 184	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → 3 ≤ (♯‘𝐴))
26		eqid 2821	. . . . . . . . . . 11 ⊢ (pmTrsp‘𝐴) = (pmTrsp‘𝐴)
27	26	pmtr3ncom 18597	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 3 ≤ (♯‘𝐴)) → ∃𝑦 ∈ ran (pmTrsp‘𝐴)∃𝑥 ∈ ran (pmTrsp‘𝐴)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥))
28		rexcom 3355	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ ran (pmTrsp‘𝐴)∃𝑦 ∈ ran (pmTrsp‘𝐴)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥) ↔ ∃𝑦 ∈ ran (pmTrsp‘𝐴)∃𝑥 ∈ ran (pmTrsp‘𝐴)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥))
29	27, 28	sylibr 236	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 3 ≤ (♯‘𝐴)) → ∃𝑥 ∈ ran (pmTrsp‘𝐴)∃𝑦 ∈ ran (pmTrsp‘𝐴)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥))
30	25, 29	syldan 593	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → ∃𝑥 ∈ ran (pmTrsp‘𝐴)∃𝑦 ∈ ran (pmTrsp‘𝐴)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥))
31		ssrexv 4034	. . . . . . . . 9 ⊢ (ran (pmTrsp‘𝐴) ⊆ (Base‘𝐺) → (∃𝑦 ∈ ran (pmTrsp‘𝐴)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥) → ∃𝑦 ∈ (Base‘𝐺)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥)))
32	31	reximdv 3273	. . . . . . . 8 ⊢ (ran (pmTrsp‘𝐴) ⊆ (Base‘𝐺) → (∃𝑥 ∈ ran (pmTrsp‘𝐴)∃𝑦 ∈ ran (pmTrsp‘𝐴)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥) → ∃𝑥 ∈ ran (pmTrsp‘𝐴)∃𝑦 ∈ (Base‘𝐺)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥)))
33	4, 30, 32	mpsyl 68	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → ∃𝑥 ∈ ran (pmTrsp‘𝐴)∃𝑦 ∈ (Base‘𝐺)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥))
34		ssrexv 4034	. . . . . . 7 ⊢ (ran (pmTrsp‘𝐴) ⊆ (Base‘𝐺) → (∃𝑥 ∈ ran (pmTrsp‘𝐴)∃𝑦 ∈ (Base‘𝐺)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥) → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥)))
35	4, 33, 34	mpsyl 68	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥))
36		eqid 2821	. . . . . . . . . 10 ⊢ (+g‘𝐺) = (+g‘𝐺)
37	2, 3, 36	symgov 18506	. . . . . . . . 9 ⊢ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑥(+g‘𝐺)𝑦) = (𝑥 ∘ 𝑦))
38	37	adantl 484	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑥(+g‘𝐺)𝑦) = (𝑥 ∘ 𝑦))
39		pm3.22 462	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑦 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)))
40	39	adantl 484	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑦 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)))
41	2, 3, 36	symgov 18506	. . . . . . . . 9 ⊢ ((𝑦 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)) → (𝑦(+g‘𝐺)𝑥) = (𝑦 ∘ 𝑥))
42	40, 41	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑦(+g‘𝐺)𝑥) = (𝑦 ∘ 𝑥))
43	38, 42	neeq12d 3077	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → ((𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥) ↔ (𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥)))
44	43	2rexbidva 3299	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → (∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥) ↔ ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝑥 ∘ 𝑦) ≠ (𝑦 ∘ 𝑥)))
45	35, 44	mpbird 259	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥))
46		rexnal 3238	. . . . . 6 ⊢ (∃𝑥 ∈ (Base‘𝐺) ¬ ∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥) ↔ ¬ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))
47		rexnal 3238	. . . . . . . 8 ⊢ (∃𝑦 ∈ (Base‘𝐺) ¬ (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥) ↔ ¬ ∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))
48		df-ne 3017	. . . . . . . . . 10 ⊢ ((𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥) ↔ ¬ (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))
49	48	bicomi 226	. . . . . . . . 9 ⊢ (¬ (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥) ↔ (𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥))
50	49	rexbii 3247	. . . . . . . 8 ⊢ (∃𝑦 ∈ (Base‘𝐺) ¬ (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥) ↔ ∃𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥))
51	47, 50	bitr3i 279	. . . . . . 7 ⊢ (¬ ∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥) ↔ ∃𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥))
52	51	rexbii 3247	. . . . . 6 ⊢ (∃𝑥 ∈ (Base‘𝐺) ¬ ∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥) ↔ ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥))
53	46, 52	bitr3i 279	. . . . 5 ⊢ (¬ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥) ↔ ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) ≠ (𝑦(+g‘𝐺)𝑥))
54	45, 53	sylibr 236	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → ¬ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))
55	54	intnand 491	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → ¬ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
56	55	intnand 491	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → ¬ (𝐺 ∈ Grp ∧ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))))
57		df-nel 3124	. . 3 ⊢ (𝐺 ∉ Abel ↔ ¬ 𝐺 ∈ Abel)
58		isabl 18904	. . . 4 ⊢ (𝐺 ∈ Abel ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ CMnd))
59	3, 36	iscmn 18908	. . . . 5 ⊢ (𝐺 ∈ CMnd ↔ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)))
60	59	anbi2i 624	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐺 ∈ CMnd) ↔ (𝐺 ∈ Grp ∧ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))))
61	58, 60	bitri 277	. . 3 ⊢ (𝐺 ∈ Abel ↔ (𝐺 ∈ Grp ∧ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))))
62	57, 61	xchbinx 336	. 2 ⊢ (𝐺 ∉ Abel ↔ ¬ (𝐺 ∈ Grp ∧ (𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)(𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))))
63	56, 62	sylibr 236	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 2 < (♯‘𝐴)) → 𝐺 ∉ Abel)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110   ≠ wne 3016   ∉ wnel 3123  ∀wral 3138  ∃wrex 3139   ⊆ wss 3936   class class class wbr 5059  ran crn 5551   ∘ ccom 5554  ‘cfv 6350  (class class class)co 7150  Fincfn 8503  1c1 10532   + caddc 10534  +∞cpnf 10666  ℝ^*cxr 10668   < clt 10669   ≤ cle 10670  2c2 11686  3c3 11687  ℕ₀cn0 11891  ♯chash 13684  Basecbs 16477  +_gcplusg 16559  Mndcmnd 17905  Grpcgrp 18097  SymGrpcsymg 18489  pmTrspcpmtr 18563  CMndccmn 18900  Abelcabl 18901

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4833  df-int 4870  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5455  df-eprel 5460  df-po 5469  df-so 5470  df-fr 5509  df-we 5511  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-pred 6143  df-ord 6189  df-on 6190  df-lim 6191  df-suc 6192  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-2o 8097  df-oadd 8100  df-er 8283  df-map 8402  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-dju 9324  df-card 9362  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-2 11694  df-3 11695  df-4 11696  df-5 11697  df-6 11698  df-7 11699  df-8 11700  df-9 11701  df-n0 11892  df-xnn0 11962  df-z 11976  df-uz 12238  df-fz 12887  df-hash 13685  df-struct 16479  df-ndx 16480  df-slot 16481  df-base 16483  df-sets 16484  df-ress 16485  df-plusg 16572  df-tset 16578  df-efmnd 18028  df-symg 18490  df-pmtr 18564  df-cmn 18902  df-abl 18903

This theorem is referenced by: (None)