MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  symgvalstruct Structured version   Visualization version   GIF version

Theorem symgvalstruct 19662
Description: 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.) (Proof shortened by AV, 6-Nov-2024.)
Hypotheses
Ref Expression
symgvalstruct.g 𝐺 = (SymGrp‘𝐴)
symgvalstruct.b 𝐵 = {𝑥 ∣ 𝑥:𝐴⟶1-1onto𝐴}
symgvalstruct.m 𝑀 = (𝐴 ↑m 𝐴)
symgvalstruct.p + = (𝑓 ∈ 𝑀, 𝑔 ∈ 𝑀 ↦ (𝑓 ∘ 𝑔))
symgvalstruct.j 𝐽 = (∏t‘(𝐴 × {𝒫 𝐴}))
Assertion
Ref Expression
symgvalstruct (𝐴 ∈ 𝑉 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
Distinct variable groups:   𝐴,𝑓,𝑔   𝑥,𝐴   𝑥,𝐵   𝑥,𝐺   𝑥,𝐽   𝑓,𝑀,𝑔   𝑥,𝑉   𝑥, +
Allowed substitution hints:   𝐵(𝑓, 𝑔)   + (𝑓, 𝑔)   𝐺(𝑓, 𝑔)   𝐽(𝑓, 𝑔)   𝑀(𝑥)   𝑉(𝑓, 𝑔)

Proof of Theorem symgvalstruct
StepHypRef Expression
1 hashv01gt1 14530 . 2 (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ∨ (♯‘𝐴) = 1 ∨ 1 < (♯‘𝐴)))
2 hasheq0 14548 . . . 4 (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅))
3 0symgefmndeq 19659 . . . . . . . . 9 (EndoFMnd‘∅) = (SymGrp‘∅)
43eqcomi 2772 . . . . . . . 8 (SymGrp‘∅) = (EndoFMnd‘∅)
5 symgvalstruct.g . . . . . . . . 9 𝐺 = (SymGrp‘𝐴)
6 fveq2 6916 . . . . . . . . 9 (𝐴 = ∅ → (SymGrp‘𝐴) = (SymGrp‘∅))
75, 6eqtrid 2810 . . . . . . . 8 (𝐴 = ∅ → 𝐺 = (SymGrp‘∅))
8 fveq2 6916 . . . . . . . 8 (𝐴 = ∅ → (EndoFMnd‘𝐴) = (EndoFMnd‘∅))
94, 7, 83eqtr4a 2824 . . . . . . 7 (𝐴 = ∅ → 𝐺 = (EndoFMnd‘𝐴))
109adantl 487 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → 𝐺 = (EndoFMnd‘𝐴))
11 eqid 2763 . . . . . . . 8 (EndoFMnd‘𝐴) = (EndoFMnd‘𝐴)
12 symgvalstruct.m . . . . . . . 8 𝑀 = (𝐴 ↑m 𝐴)
13 symgvalstruct.p . . . . . . . 8 + = (𝑓 ∈ 𝑀, 𝑔 ∈ 𝑀 ↦ (𝑓 ∘ 𝑔))
14 symgvalstruct.j . . . . . . . 8 𝐽 = (∏t‘(𝐴 × {𝒫 𝐴}))
1511, 12, 13, 14efmnd 19116 . . . . . . 7 (𝐴 ∈ 𝑉 → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
1615adantr 486 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
17 0map0sn0 8951 . . . . . . . . . . 11 (∅ ↑m ∅) = {∅}
18 id 23 . . . . . . . . . . . 12 (𝐴 = ∅ → 𝐴 = ∅)
1918, 18oveq12d 7469 . . . . . . . . . . 11 (𝐴 = ∅ → (𝐴 ↑m 𝐴) = (∅ ↑m ∅))
20 symgvalstruct.b . . . . . . . . . . . 12 𝐵 = {𝑥 ∣ 𝑥:𝐴⟶1-1onto𝐴}
217fveq2d 6920 . . . . . . . . . . . . 13 (𝐴 = ∅ → (Base‘𝐺) = (Base‘(SymGrp‘∅)))
22 eqid 2763 . . . . . . . . . . . . . 14 (Base‘𝐺) = (Base‘𝐺)
235, 22symgbas 19637 . . . . . . . . . . . . 13 (Base‘𝐺) = {𝑥 ∣ 𝑥:𝐴⟶1-1onto𝐴}
24 symgbas0 19654 . . . . . . . . . . . . 13 (Base‘(SymGrp‘∅)) = {∅}
2521, 23, 243eqtr3g 2821 . . . . . . . . . . . 12 (𝐴 = ∅ → {𝑥 ∣ 𝑥:𝐴⟶1-1onto𝐴} = {∅})
2620, 25eqtrid 2810 . . . . . . . . . . 11 (𝐴 = ∅ → 𝐵 = {∅})
2717, 19, 263eqtr4a 2824 . . . . . . . . . 10 (𝐴 = ∅ → (𝐴 ↑m 𝐴) = 𝐵)
2827adantl 487 . . . . . . . . 9 ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → (𝐴 ↑m 𝐴) = 𝐵)
2912, 28eqtrid 2810 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → 𝑀 = 𝐵)
3029opeq2d 4852 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → ⟨(Base‘ndx), 𝑀⟩ = ⟨(Base‘ndx), 𝐵⟩)
3130tpeq1d 4708 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
3210, 16, 313eqtrd 2802 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐴 = ∅) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
3332ex 418 . . . 4 (𝐴 ∈ 𝑉 → (𝐴 = ∅ → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
342, 33sylbid 243 . . 3 (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 0 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
35 hash1snb 14605 . . . 4 (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 1 ↔ ∃𝑥 𝐴 = {𝑥}))
36 vsnex 5400 . . . . . . . 8 {𝑥} ∈ V
37 eleq1 2852 . . . . . . . 8 (𝐴 = {𝑥} → (𝐴 ∈ V ↔ {𝑥} ∈ V))
3836, 37mpbiri 261 . . . . . . 7 (𝐴 = {𝑥} → 𝐴 ∈ V)
3911, 12, 13, 14efmnd 19116 . . . . . . 7 (𝐴 ∈ V → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
4038, 39syl 18 . . . . . 6 (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
41 snsymgefmndeq 19660 . . . . . . 7 (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = (SymGrp‘𝐴))
4241, 5eqtr4di 2816 . . . . . 6 (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = 𝐺)
4342fveq2d 6920 . . . . . . . . 9 (𝐴 = {𝑥} → (Base‘(EndoFMnd‘𝐴)) = (Base‘𝐺))
44 eqid 2763 . . . . . . . . . . 11 (Base‘(EndoFMnd‘𝐴)) = (Base‘(EndoFMnd‘𝐴))
4511, 44efmndbas 19117 . . . . . . . . . 10 (Base‘(EndoFMnd‘𝐴)) = (𝐴 ↑m 𝐴)
4645, 12eqtr4i 2789 . . . . . . . . 9 (Base‘(EndoFMnd‘𝐴)) = 𝑀
4723, 20eqtr4i 2789 . . . . . . . . 9 (Base‘𝐺) = 𝐵
4843, 46, 473eqtr3g 2821 . . . . . . . 8 (𝐴 = {𝑥} → 𝑀 = 𝐵)
4948opeq2d 4852 . . . . . . 7 (𝐴 = {𝑥} → ⟨(Base‘ndx), 𝑀⟩ = ⟨(Base‘ndx), 𝐵⟩)
5049tpeq1d 4708 . . . . . 6 (𝐴 = {𝑥} → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
5140, 42, 503eqtr3d 2806 . . . . 5 (𝐴 = {𝑥} → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
5251exlimiv 1965 . . . 4 (∃𝑥 𝐴 = {𝑥} → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
5335, 52biimtrdi 256 . . 3 (𝐴 ∈ 𝑉 → ((♯‘𝐴) = 1 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
54 ssnpss 4037 . . . . . . 7 ((𝐴 ↑m 𝐴) ⊆ 𝐵 → ¬ 𝐵 ⊊ (𝐴 ↑m 𝐴))
5511, 5symgpssefmnd 19661 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (Base‘𝐺) ⊊ (Base‘(EndoFMnd‘𝐴)))
5620, 23eqtr4i 2789 . . . . . . . . 9 𝐵 = (Base‘𝐺)
5745eqcomi 2772 . . . . . . . . 9 (𝐴 ↑m 𝐴) = (Base‘(EndoFMnd‘𝐴))
5856, 57psseq12i 4024 . . . . . . . 8 (𝐵 ⊊ (𝐴 ↑m 𝐴) ↔ (Base‘𝐺) ⊊ (Base‘(EndoFMnd‘𝐴)))
5955, 58sylibr 237 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ⊊ (𝐴 ↑m 𝐴))
6054, 59nsyl3 139 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ¬ (𝐴 ↑m 𝐴) ⊆ 𝐵)
61 fvexd 6931 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (EndoFMnd‘𝐴) ∈ V)
62 f1osetex 8919 . . . . . . . 8 {𝑥 ∣ 𝑥:𝐴⟶1-1onto𝐴} ∈ V
6320, 62eqeltri 2860 . . . . . . 7 𝐵 ∈ V
6463a1i 11 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ∈ V)
655, 20symgval 19636 . . . . . . 7 𝐺 = ((EndoFMnd‘𝐴) ↾s 𝐵)
6665, 57ressval2 17457 . . . . . 6 ((¬ (𝐴 ↑m 𝐴) ⊆ 𝐵 ∧ (EndoFMnd‘𝐴) ∈ V ∧ 𝐵 ∈ V) → 𝐺 = ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩))
6760, 61, 64, 66syl3anc 1399 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐺 = ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩))
68 ovex 7484 . . . . . . 7 (𝐴 ↑m 𝐴) ∈ V
6968inex2 5285 . . . . . 6 (𝐵 ∩ (𝐴 ↑m 𝐴)) ∈ V
70 setsval 17389 . . . . . 6 (((EndoFMnd‘𝐴) ∈ V ∧ (𝐵 ∩ (𝐴 ↑m 𝐴)) ∈ V) → ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩) = (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
7161, 69, 70sylancl 598 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩) = (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
7215adantr 486 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
7372reseq1d 5985 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) = ({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})))
7473uneq1d 4169 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = (({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
75 eqidd 2764 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
76 fvexd 6931 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (+g‘ndx) ∈ V)
77 fvexd 6931 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (TopSet‘ndx) ∈ V)
7812, 68eqeltri 2860 . . . . . . . . . . 11 𝑀 ∈ V
7978, 78mpoex 8127 . . . . . . . . . 10 (𝑓 ∈ 𝑀, 𝑔 ∈ 𝑀 ↦ (𝑓 ∘ 𝑔)) ∈ V
8013, 79eqeltri 2860 . . . . . . . . 9 + ∈ V
8180a1i 11 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → + ∈ V)
8214fvexi 6930 . . . . . . . . 9 𝐽 ∈ V
8382a1i 11 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐽 ∈ V)
84 basendxnplusgndx 17504 . . . . . . . . . 10 (Base‘ndx) ≠ (+g‘ndx)
8584necomi 3013 . . . . . . . . 9 (+g‘ndx) ≠ (Base‘ndx)
8685a1i 11 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (+g‘ndx) ≠ (Base‘ndx))
87 tsetndxnbasendx 17573 . . . . . . . . 9 (TopSet‘ndx) ≠ (Base‘ndx)
8887a1i 11 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (TopSet‘ndx) ≠ (Base‘ndx))
8975, 76, 77, 81, 83, 86, 88tpres 7238 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) = {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
9089uneq1d 4169 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}))
91 uncom 4160 . . . . . . . 8 ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = ({⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩} ∪ {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
92 tpass 4715 . . . . . . . 8 {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = ({⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩} ∪ {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
9391, 92eqtr4i 2789 . . . . . . 7 ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}
945, 56symgbasmap 19642 . . . . . . . . . . . 12 (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐴 ↑m 𝐴))
9594a1i 11 . . . . . . . . . . 11 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐴 ↑m 𝐴)))
9695ssrdv 3919 . . . . . . . . . 10 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ⊆ (𝐴 ↑m 𝐴))
97 dfss2 4097 . . . . . . . . . 10 (𝐵 ⊆ (𝐴 ↑m 𝐴) ↔ (𝐵 ∩ (𝐴 ↑m 𝐴)) = 𝐵)
9896, 97sylib 221 . . . . . . . . 9 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (𝐵 ∩ (𝐴 ↑m 𝐴)) = 𝐵)
9998opeq2d 4852 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩ = ⟨(Base‘ndx), 𝐵⟩)
10099tpeq1d 4708 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
10193, 100eqtrid 2810 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
10274, 90, 1013eqtrd 2802 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴 ↑m 𝐴))⟩}) = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
10367, 71, 1023eqtrd 2802 . . . 4 ((𝐴 ∈ 𝑉 ∧ 1 < (♯‘𝐴)) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
104103ex 418 . . 3 (𝐴 ∈ 𝑉 → (1 < (♯‘𝐴) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
10534, 53, 1043jaod 1457 . 2 (𝐴 ∈ 𝑉 → (((♯‘𝐴) = 0 ∨ (♯‘𝐴) = 1 ∨ 1 < (♯‘𝐴)) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
1061, 105mpd 16 1 (𝐴 ∈ 𝑉 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900   ⊊ wpss 4016   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  𝒫 cpw 4560  {csn 4588  {cpr 4590  {ctp 4592  ⟨cop 4840   class class class wbr 5108   × cxp 5656   ↾ cres 5660   ∘ ccom 5662  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453   ↑m cmap 8885  0cc0 11239  1c1 11240   < clt 11382  ♯chash 14515   sSet csts 17385  ndxcnx 17415  Basecbs 17431  +gcplusg 17472  TopSetcts 17478  ∏tcpt 17659  EndoFMndcefmnd 19114  SymGrpcsymg 19634
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-xnn0 12720  df-z 12734  df-uz 13006  df-fz 13680  df-hash 14516  df-struct 17369  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-tset 17492  df-efmnd 19115  df-symg 19635
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator