Theorem symgvalstructOLD 19343

Description: Obsolete proof of symgvalstruct 19342 as of 6-Nov-2024. The value of the symmetric group function at 𝐴 represented as extensible structure with three slots. This corresponds to the former definition of SymGrp. (Contributed by Paul Chapman, 25-Feb-2008.) (Revised by Mario Carneiro, 12-Jan-2015.) (Revised by AV, 31-Mar-2024.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
symgvalstructOLD.g	⊢ 𝐺 = (SymGrp‘𝐴)
symgvalstructOLD.b	⊢ 𝐵 = {𝑥 ∣ 𝑥:𝐴–1-1-onto→𝐴}
symgvalstructOLD.m	⊢ 𝑀 = (𝐴 ↑m 𝐴)
symgvalstructOLD.p	⊢ + = (𝑓 ∈ 𝑀, 𝑔 ∈ 𝑀 ↦ (𝑓 ∘ 𝑔))
symgvalstructOLD.j	⊢ 𝐽 = (∏t‘(𝐴 × {𝒫 𝐴}))

Assertion

Ref	Expression
symgvalstructOLD	⊢ (𝐴 ∈ 𝑉 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})

Distinct variable groups:   𝐴,𝑓,𝑔   𝑥,𝐴   𝑥,𝐵   𝑥,𝐺   𝑥,𝐽   𝑓,𝑀,𝑔   𝑥,𝑉   𝑥, +

Allowed substitution hints:   𝐵(𝑓,𝑔)   + (𝑓,𝑔)   𝐺(𝑓,𝑔)   𝐽(𝑓,𝑔)   𝑀(𝑥)   𝑉(𝑓,𝑔)

Proof of Theorem symgvalstructOLD

Step	Hyp	Ref	Expression
1		hashv01gt1 14328	. 2 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ∨ (♯‘𝐴) = 1 ∨ 1 < (♯‘𝐴)))
2		hasheq0 14346	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅))
3		0symgefmndeq 19339	. . . . . . . . 9 ⊢ (EndoFMnd‘∅) = (SymGrp‘∅)
4	3	eqcomi 2736	. . . . . . . 8 ⊢ (SymGrp‘∅) = (EndoFMnd‘∅)
5		symgvalstructOLD.g	. . . . . . . . 9 ⊢ 𝐺 = (SymGrp‘𝐴)
6		fveq2 6891	. . . . . . . . 9 ⊢ (𝐴 = ∅ → (SymGrp‘𝐴) = (SymGrp‘∅))
7	5, 6	eqtrid 2779	. . . . . . . 8 ⊢ (𝐴 = ∅ → 𝐺 = (SymGrp‘∅))
8		fveq2 6891	. . . . . . . 8 ⊢ (𝐴 = ∅ → (EndoFMnd‘𝐴) = (EndoFMnd‘∅))
9	4, 7, 8	3eqtr4a 2793	. . . . . . 7 ⊢ (𝐴 = ∅ → 𝐺 = (EndoFMnd‘𝐴))
10	9	adantl 481	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → 𝐺 = (EndoFMnd‘𝐴))
11		eqid 2727	. . . . . . . 8 ⊢ (EndoFMnd‘𝐴) = (EndoFMnd‘𝐴)
12		symgvalstructOLD.m	. . . . . . . 8 ⊢ 𝑀 = (𝐴 ↑m 𝐴)
13		symgvalstructOLD.p	. . . . . . . 8 ⊢ + = (𝑓 ∈ 𝑀, 𝑔 ∈ 𝑀 ↦ (𝑓 ∘ 𝑔))
14		symgvalstructOLD.j	. . . . . . . 8 ⊢ 𝐽 = (∏t‘(𝐴 × {𝒫 𝐴}))
15	11, 12, 13, 14	efmnd 18813	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
16	15	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
17		0map0sn0 8895	. . . . . . . . . . 11 ⊢ (∅ ↑m ∅) = {∅}
18		id 22	. . . . . . . . . . . 12 ⊢ (𝐴 = ∅ → 𝐴 = ∅)
19	18, 18	oveq12d 7432	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → (𝐴 ↑m 𝐴) = (∅ ↑m ∅))
20		symgvalstructOLD.b	. . . . . . . . . . . 12 ⊢ 𝐵 = {𝑥 ∣ 𝑥:𝐴–1-1-onto→𝐴}
21	7	fveq2d 6895	. . . . . . . . . . . . 13 ⊢ (𝐴 = ∅ → (Base‘𝐺) = (Base‘(SymGrp‘∅)))
22		eqid 2727	. . . . . . . . . . . . . 14 ⊢ (Base‘𝐺) = (Base‘𝐺)
23	5, 22	symgbas 19316	. . . . . . . . . . . . 13 ⊢ (Base‘𝐺) = {𝑥 ∣ 𝑥:𝐴–1-1-onto→𝐴}
24		symgbas0 19334	. . . . . . . . . . . . 13 ⊢ (Base‘(SymGrp‘∅)) = {∅}
25	21, 23, 24	3eqtr3g 2790	. . . . . . . . . . . 12 ⊢ (𝐴 = ∅ → {𝑥 ∣ 𝑥:𝐴–1-1-onto→𝐴} = {∅})
26	20, 25	eqtrid 2779	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → 𝐵 = {∅})
27	17, 19, 26	3eqtr4a 2793	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐴 ↑m 𝐴) = 𝐵)
28	27	adantl 481	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → (𝐴 ↑m 𝐴) = 𝐵)
29	12, 28	eqtrid 2779	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → 𝑀 = 𝐵)
30	29	opeq2d 4876	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → ⟨(Base‘ndx), 𝑀⟩ = ⟨(Base‘ndx), 𝐵⟩)
31	30	tpeq1d 4745	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
32	10, 16, 31	3eqtrd 2771	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
33	32	ex 412	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = ∅ → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
34	2, 33	sylbid 239	. . 3 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
35		hash1snb 14402	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 1 ↔ ∃𝑥 𝐴 = {𝑥}))
36		snex 5427	. . . . . . . 8 ⊢ {𝑥} ∈ V
37		eleq1 2816	. . . . . . . 8 ⊢ (𝐴 = {𝑥} → (𝐴 ∈ V ↔ {𝑥} ∈ V))
38	36, 37	mpbiri 258	. . . . . . 7 ⊢ (𝐴 = {𝑥} → 𝐴 ∈ V)
39	11, 12, 13, 14	efmnd 18813	. . . . . . 7 ⊢ (𝐴 ∈ V → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
40	38, 39	syl 17	. . . . . 6 ⊢ (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
41		snsymgefmndeq 19340	. . . . . . 7 ⊢ (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = (SymGrp‘𝐴))
42	41, 5	eqtr4di 2785	. . . . . 6 ⊢ (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = 𝐺)
43	42	fveq2d 6895	. . . . . . . . 9 ⊢ (𝐴 = {𝑥} → (Base‘(EndoFMnd‘𝐴)) = (Base‘𝐺))
44		eqid 2727	. . . . . . . . . . 11 ⊢ (Base‘(EndoFMnd‘𝐴)) = (Base‘(EndoFMnd‘𝐴))
45	11, 44	efmndbas 18814	. . . . . . . . . 10 ⊢ (Base‘(EndoFMnd‘𝐴)) = (𝐴 ↑m 𝐴)
46	45, 12	eqtr4i 2758	. . . . . . . . 9 ⊢ (Base‘(EndoFMnd‘𝐴)) = 𝑀
47	23, 20	eqtr4i 2758	. . . . . . . . 9 ⊢ (Base‘𝐺) = 𝐵
48	43, 46, 47	3eqtr3g 2790	. . . . . . . 8 ⊢ (𝐴 = {𝑥} → 𝑀 = 𝐵)
49	48	opeq2d 4876	. . . . . . 7 ⊢ (𝐴 = {𝑥} → ⟨(Base‘ndx), 𝑀⟩ = ⟨(Base‘ndx), 𝐵⟩)
50	49	tpeq1d 4745	. . . . . 6 ⊢ (𝐴 = {𝑥} → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
51	40, 42, 50	3eqtr3d 2775	. . . . 5 ⊢ (𝐴 = {𝑥} → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
52	51	exlimiv 1926	. . . 4 ⊢ (∃𝑥 𝐴 = {𝑥} → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
53	35, 52	biimtrdi 252	. . 3 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 1 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
54		ssnpss 4099	. . . . . . 7 ⊢ ((𝐴 ↑m 𝐴) ⊆ 𝐵 → ¬ 𝐵 ⊊ (𝐴 ↑m 𝐴))
55	11, 5	symgpssefmnd 19341	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (Base‘𝐺) ⊊ (Base‘(EndoFMnd‘𝐴)))
56	20, 23	eqtr4i 2758	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐺)
57	45	eqcomi 2736	. . . . . . . . 9 ⊢ (𝐴 ↑m 𝐴) = (Base‘(EndoFMnd‘𝐴))
58	56, 57	psseq12i 4087	. . . . . . . 8 ⊢ (𝐵 ⊊ (𝐴 ↑m 𝐴) ↔ (Base‘𝐺) ⊊ (Base‘(EndoFMnd‘𝐴)))
59	55, 58	sylibr 233	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ⊊ (𝐴 ↑m 𝐴))
60	54, 59	nsyl3 138	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ¬ (𝐴 ↑m 𝐴) ⊆ 𝐵)
61		fvexd 6906	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (EndoFMnd‘𝐴) ∈ V)
62		f1osetex 8869	. . . . . . . 8 ⊢ {𝑥 ∣ 𝑥:𝐴–1-1-onto→𝐴} ∈ V
63	20, 62	eqeltri 2824	. . . . . . 7 ⊢ 𝐵 ∈ V
64	63	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ∈ V)
65	5, 20	symgval 19314	. . . . . . 7 ⊢ 𝐺 = ((EndoFMnd‘𝐴) ↾s 𝐵)
66	65, 57	ressval2 17205	. . . . . 6 ⊢ ((¬ (𝐴 ↑m 𝐴) ⊆ 𝐵 ∧ (EndoFMnd‘𝐴) ∈ V ∧ 𝐵 ∈ V) → 𝐺 = ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩))
67	60, 61, 64, 66	syl3anc 1369	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐺 = ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩))
68		ovex 7447	. . . . . . 7 ⊢ (𝐴 ↑m 𝐴) ∈ V
69	68	inex2 5312	. . . . . 6 ⊢ (𝐵 ∩ (𝐴 ↑m 𝐴)) ∈ V
70		setsval 17127	. . . . . 6 ⊢ (((EndoFMnd‘𝐴) ∈ V ∧ (𝐵 ∩ (𝐴 ↑m 𝐴)) ∈ V) → ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩) = (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
71	61, 69, 70	sylancl 585	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩) = (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
72	15	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
73	72	reseq1d 5978	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) = ({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})))
74	73	uneq1d 4158	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = (({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
75		eqidd 2728	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
76		fvexd 6906	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (+g‘ndx) ∈ V)
77		fvexd 6906	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (TopSet‘ndx) ∈ V)
78	12, 68	eqeltri 2824	. . . . . . . . . . 11 ⊢ 𝑀 ∈ V
79	78, 78	mpoex 8078	. . . . . . . . . 10 ⊢ (𝑓 ∈ 𝑀, 𝑔 ∈ 𝑀 ↦ (𝑓 ∘ 𝑔)) ∈ V
80	13, 79	eqeltri 2824	. . . . . . . . 9 ⊢ + ∈ V
81	80	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → + ∈ V)
82	14	fvexi 6905	. . . . . . . . 9 ⊢ 𝐽 ∈ V
83	82	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐽 ∈ V)
84		basendxnplusgndx 17254	. . . . . . . . . 10 ⊢ (Base‘ndx) ≠ (+g‘ndx)
85	84	necomi 2990	. . . . . . . . 9 ⊢ (+g‘ndx) ≠ (Base‘ndx)
86	85	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (+g‘ndx) ≠ (Base‘ndx))
87		tsetndx 17324	. . . . . . . . . 10 ⊢ (TopSet‘ndx) = 9
88		1re 11236	. . . . . . . . . . . 12 ⊢ 1 ∈ ℝ
89		1lt9 12440	. . . . . . . . . . . 12 ⊢ 1 < 9
90	88, 89	gtneii 11348	. . . . . . . . . . 11 ⊢ 9 ≠ 1
91		df-base 17172	. . . . . . . . . . . 12 ⊢ Base = Slot 1
92		1nn 12245	. . . . . . . . . . . 12 ⊢ 1 ∈ ℕ
93	91, 92	ndxarg 17156	. . . . . . . . . . 11 ⊢ (Base‘ndx) = 1
94	90, 93	neeqtrri 3009	. . . . . . . . . 10 ⊢ 9 ≠ (Base‘ndx)
95	87, 94	eqnetri 3006	. . . . . . . . 9 ⊢ (TopSet‘ndx) ≠ (Base‘ndx)
96	95	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (TopSet‘ndx) ≠ (Base‘ndx))
97	75, 76, 77, 81, 83, 86, 96	tpres 7207	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) = {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
98	97	uneq1d 4158	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
99		uncom 4149	. . . . . . . 8 ⊢ ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = ({⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩} ∪ {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
100		tpass 4752	. . . . . . . 8 ⊢ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = ({⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩} ∪ {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
101	99, 100	eqtr4i 2758	. . . . . . 7 ⊢ ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}
102	5, 56	symgbasmap 19322	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐴 ↑m 𝐴))
103	102	a1i 11	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐴 ↑m 𝐴)))
104	103	ssrdv 3984	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ⊆ (𝐴 ↑m 𝐴))
105		df-ss 3961	. . . . . . . . . 10 ⊢ (𝐵 ⊆ (𝐴 ↑m 𝐴) ↔ (𝐵 ∩ (𝐴 ↑m 𝐴)) = 𝐵)
106	104, 105	sylib 217	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (𝐵 ∩ (𝐴 ↑m 𝐴)) = 𝐵)
107	106	opeq2d 4876	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩ = ⟨(Base‘ndx), 𝐵⟩)
108	107	tpeq1d 4745	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
109	101, 108	eqtrid 2779	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
110	74, 98, 109	3eqtrd 2771	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
111	67, 71, 110	3eqtrd 2771	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
112	111	ex 412	. . 3 ⊢ (𝐴 ∈ 𝑉 → (1 < (♯‘𝐴) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
113	34, 53, 112	3jaod 1426	. 2 ⊢ (𝐴 ∈ 𝑉 → (((♯‘𝐴) = 0 ∨ (♯‘𝐴) = 1 ∨ 1 < (♯‘𝐴)) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
114	1, 113	mpd 15	1 ⊢ (𝐴 ∈ 𝑉 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ w3o 1084   = wceq 1534  ∃wex 1774   ∈ wcel 2099  {cab 2704   ≠ wne 2935  Vcvv 3469   ∖ cdif 3941   ∪ cun 3942   ∩ cin 3943   ⊆ wss 3944   ⊊ wpss 3945  ∅c0 4318  𝒫 cpw 4598  {csn 4624  {cpr 4626  {ctp 4628  ⟨cop 4630   class class class wbr 5142   × cxp 5670   ↾ cres 5674   ∘ ccom 5676  –1-1-onto→wf1o 6541  ‘cfv 6542  (class class class)co 7414   ∈ cmpo 7416   ↑_m cmap 8836  0cc0 11130  1c1 11131   < clt 11270  9c9 12296  ♯chash 14313   sSet csts 17123  ndxcnx 17153  Basecbs 17171  +_gcplusg 17224  TopSetcts 17230  ∏_tcpt 17411  EndoFMndcefmnd 18811  SymGrpcsymg 19312

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734  ax-cnex 11186  ax-resscn 11187  ax-1cn 11188  ax-icn 11189  ax-addcl 11190  ax-addrcl 11191  ax-mulcl 11192  ax-mulrcl 11193  ax-mulcom 11194  ax-addass 11195  ax-mulass 11196  ax-distr 11197  ax-i2m1 11198  ax-1ne0 11199  ax-1rid 11200  ax-rnegex 11201  ax-rrecex 11202  ax-cnre 11203  ax-pre-lttri 11204  ax-pre-lttrn 11205  ax-pre-ltadd 11206  ax-pre-mulgt0 11207

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-nel 3042  df-ral 3057  df-rex 3066  df-reu 3372  df-rab 3428  df-v 3471  df-sbc 3775  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3963  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-tp 4629  df-op 4631  df-uni 4904  df-int 4945  df-iun 4993  df-br 5143  df-opab 5205  df-mpt 5226  df-tr 5260  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6299  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7370  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7865  df-1st 7987  df-2nd 7988  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-oadd 8484  df-er 8718  df-map 8838  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-dju 9916  df-card 9954  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11468  df-neg 11469  df-nn 12235  df-2 12297  df-3 12298  df-4 12299  df-5 12300  df-6 12301  df-7 12302  df-8 12303  df-9 12304  df-n0 12495  df-xnn0 12567  df-z 12581  df-uz 12845  df-fz 13509  df-hash 14314  df-struct 17107  df-sets 17124  df-slot 17142  df-ndx 17154  df-base 17172  df-ress 17201  df-plusg 17237  df-tset 17243  df-efmnd 18812  df-symg 19313

This theorem is referenced by: (None)