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

Theorem symgvalstructOLD 19265
Description: Obsolete proof of symgvalstruct 19264 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
StepHypRef Expression
1 hashv01gt1 14305 . 2 (𝐴𝑉 → ((♯‘𝐴) = 0 ∨ (♯‘𝐴) = 1 ∨ 1 < (♯‘𝐴)))
2 hasheq0 14323 . . . 4 (𝐴𝑉 → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅))
3 0symgefmndeq 19261 . . . . . . . . 9 (EndoFMnd‘∅) = (SymGrp‘∅)
43eqcomi 2742 . . . . . . . 8 (SymGrp‘∅) = (EndoFMnd‘∅)
5 symgvalstructOLD.g . . . . . . . . 9 𝐺 = (SymGrp‘𝐴)
6 fveq2 6892 . . . . . . . . 9 (𝐴 = ∅ → (SymGrp‘𝐴) = (SymGrp‘∅))
75, 6eqtrid 2785 . . . . . . . 8 (𝐴 = ∅ → 𝐺 = (SymGrp‘∅))
8 fveq2 6892 . . . . . . . 8 (𝐴 = ∅ → (EndoFMnd‘𝐴) = (EndoFMnd‘∅))
94, 7, 83eqtr4a 2799 . . . . . . 7 (𝐴 = ∅ → 𝐺 = (EndoFMnd‘𝐴))
109adantl 483 . . . . . 6 ((𝐴𝑉𝐴 = ∅) → 𝐺 = (EndoFMnd‘𝐴))
11 eqid 2733 . . . . . . . 8 (EndoFMnd‘𝐴) = (EndoFMnd‘𝐴)
12 symgvalstructOLD.m . . . . . . . 8 𝑀 = (𝐴m 𝐴)
13 symgvalstructOLD.p . . . . . . . 8 + = (𝑓𝑀, 𝑔𝑀 ↦ (𝑓𝑔))
14 symgvalstructOLD.j . . . . . . . 8 𝐽 = (∏t‘(𝐴 × {𝒫 𝐴}))
1511, 12, 13, 14efmnd 18751 . . . . . . 7 (𝐴𝑉 → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
1615adantr 482 . . . . . 6 ((𝐴𝑉𝐴 = ∅) → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
17 0map0sn0 8879 . . . . . . . . . . 11 (∅ ↑m ∅) = {∅}
18 id 22 . . . . . . . . . . . 12 (𝐴 = ∅ → 𝐴 = ∅)
1918, 18oveq12d 7427 . . . . . . . . . . 11 (𝐴 = ∅ → (𝐴m 𝐴) = (∅ ↑m ∅))
20 symgvalstructOLD.b . . . . . . . . . . . 12 𝐵 = {𝑥𝑥:𝐴1-1-onto𝐴}
217fveq2d 6896 . . . . . . . . . . . . 13 (𝐴 = ∅ → (Base‘𝐺) = (Base‘(SymGrp‘∅)))
22 eqid 2733 . . . . . . . . . . . . . 14 (Base‘𝐺) = (Base‘𝐺)
235, 22symgbas 19238 . . . . . . . . . . . . 13 (Base‘𝐺) = {𝑥𝑥:𝐴1-1-onto𝐴}
24 symgbas0 19256 . . . . . . . . . . . . 13 (Base‘(SymGrp‘∅)) = {∅}
2521, 23, 243eqtr3g 2796 . . . . . . . . . . . 12 (𝐴 = ∅ → {𝑥𝑥:𝐴1-1-onto𝐴} = {∅})
2620, 25eqtrid 2785 . . . . . . . . . . 11 (𝐴 = ∅ → 𝐵 = {∅})
2717, 19, 263eqtr4a 2799 . . . . . . . . . 10 (𝐴 = ∅ → (𝐴m 𝐴) = 𝐵)
2827adantl 483 . . . . . . . . 9 ((𝐴𝑉𝐴 = ∅) → (𝐴m 𝐴) = 𝐵)
2912, 28eqtrid 2785 . . . . . . . 8 ((𝐴𝑉𝐴 = ∅) → 𝑀 = 𝐵)
3029opeq2d 4881 . . . . . . 7 ((𝐴𝑉𝐴 = ∅) → ⟨(Base‘ndx), 𝑀⟩ = ⟨(Base‘ndx), 𝐵⟩)
3130tpeq1d 4750 . . . . . 6 ((𝐴𝑉𝐴 = ∅) → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
3210, 16, 313eqtrd 2777 . . . . 5 ((𝐴𝑉𝐴 = ∅) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
3332ex 414 . . . 4 (𝐴𝑉 → (𝐴 = ∅ → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
342, 33sylbid 239 . . 3 (𝐴𝑉 → ((♯‘𝐴) = 0 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
35 hash1snb 14379 . . . 4 (𝐴𝑉 → ((♯‘𝐴) = 1 ↔ ∃𝑥 𝐴 = {𝑥}))
36 snex 5432 . . . . . . . 8 {𝑥} ∈ V
37 eleq1 2822 . . . . . . . 8 (𝐴 = {𝑥} → (𝐴 ∈ V ↔ {𝑥} ∈ V))
3836, 37mpbiri 258 . . . . . . 7 (𝐴 = {𝑥} → 𝐴 ∈ V)
3911, 12, 13, 14efmnd 18751 . . . . . . 7 (𝐴 ∈ V → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
4038, 39syl 17 . . . . . 6 (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
41 snsymgefmndeq 19262 . . . . . . 7 (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = (SymGrp‘𝐴))
4241, 5eqtr4di 2791 . . . . . 6 (𝐴 = {𝑥} → (EndoFMnd‘𝐴) = 𝐺)
4342fveq2d 6896 . . . . . . . . 9 (𝐴 = {𝑥} → (Base‘(EndoFMnd‘𝐴)) = (Base‘𝐺))
44 eqid 2733 . . . . . . . . . . 11 (Base‘(EndoFMnd‘𝐴)) = (Base‘(EndoFMnd‘𝐴))
4511, 44efmndbas 18752 . . . . . . . . . 10 (Base‘(EndoFMnd‘𝐴)) = (𝐴m 𝐴)
4645, 12eqtr4i 2764 . . . . . . . . 9 (Base‘(EndoFMnd‘𝐴)) = 𝑀
4723, 20eqtr4i 2764 . . . . . . . . 9 (Base‘𝐺) = 𝐵
4843, 46, 473eqtr3g 2796 . . . . . . . 8 (𝐴 = {𝑥} → 𝑀 = 𝐵)
4948opeq2d 4881 . . . . . . 7 (𝐴 = {𝑥} → ⟨(Base‘ndx), 𝑀⟩ = ⟨(Base‘ndx), 𝐵⟩)
5049tpeq1d 4750 . . . . . 6 (𝐴 = {𝑥} → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
5140, 42, 503eqtr3d 2781 . . . . 5 (𝐴 = {𝑥} → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
5251exlimiv 1934 . . . 4 (∃𝑥 𝐴 = {𝑥} → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
5335, 52syl6bi 253 . . 3 (𝐴𝑉 → ((♯‘𝐴) = 1 → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
54 ssnpss 4104 . . . . . . 7 ((𝐴m 𝐴) ⊆ 𝐵 → ¬ 𝐵 ⊊ (𝐴m 𝐴))
5511, 5symgpssefmnd 19263 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (Base‘𝐺) ⊊ (Base‘(EndoFMnd‘𝐴)))
5620, 23eqtr4i 2764 . . . . . . . . 9 𝐵 = (Base‘𝐺)
5745eqcomi 2742 . . . . . . . . 9 (𝐴m 𝐴) = (Base‘(EndoFMnd‘𝐴))
5856, 57psseq12i 4092 . . . . . . . 8 (𝐵 ⊊ (𝐴m 𝐴) ↔ (Base‘𝐺) ⊊ (Base‘(EndoFMnd‘𝐴)))
5955, 58sylibr 233 . . . . . . 7 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ⊊ (𝐴m 𝐴))
6054, 59nsyl3 138 . . . . . 6 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → ¬ (𝐴m 𝐴) ⊆ 𝐵)
61 fvexd 6907 . . . . . 6 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (EndoFMnd‘𝐴) ∈ V)
62 f1osetex 8853 . . . . . . . 8 {𝑥𝑥:𝐴1-1-onto𝐴} ∈ V
6320, 62eqeltri 2830 . . . . . . 7 𝐵 ∈ V
6463a1i 11 . . . . . 6 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ∈ V)
655, 20symgval 19236 . . . . . . 7 𝐺 = ((EndoFMnd‘𝐴) ↾s 𝐵)
6665, 57ressval2 17178 . . . . . 6 ((¬ (𝐴m 𝐴) ⊆ 𝐵 ∧ (EndoFMnd‘𝐴) ∈ V ∧ 𝐵 ∈ V) → 𝐺 = ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩))
6760, 61, 64, 66syl3anc 1372 . . . . 5 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → 𝐺 = ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩))
68 ovex 7442 . . . . . . 7 (𝐴m 𝐴) ∈ V
6968inex2 5319 . . . . . 6 (𝐵 ∩ (𝐴m 𝐴)) ∈ V
70 setsval 17100 . . . . . 6 (((EndoFMnd‘𝐴) ∈ V ∧ (𝐵 ∩ (𝐴m 𝐴)) ∈ V) → ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩) = (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}))
7161, 69, 70sylancl 587 . . . . 5 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → ((EndoFMnd‘𝐴) sSet ⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩) = (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}))
7215adantr 482 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (EndoFMnd‘𝐴) = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
7372reseq1d 5981 . . . . . . 7 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → ((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) = ({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})))
7473uneq1d 4163 . . . . . 6 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}) = (({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}))
75 eqidd 2734 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
76 fvexd 6907 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (+g‘ndx) ∈ V)
77 fvexd 6907 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (TopSet‘ndx) ∈ V)
7812, 68eqeltri 2830 . . . . . . . . . . 11 𝑀 ∈ V
7978, 78mpoex 8066 . . . . . . . . . 10 (𝑓𝑀, 𝑔𝑀 ↦ (𝑓𝑔)) ∈ V
8013, 79eqeltri 2830 . . . . . . . . 9 + ∈ V
8180a1i 11 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → + ∈ V)
8214fvexi 6906 . . . . . . . . 9 𝐽 ∈ V
8382a1i 11 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → 𝐽 ∈ V)
84 basendxnplusgndx 17227 . . . . . . . . . 10 (Base‘ndx) ≠ (+g‘ndx)
8584necomi 2996 . . . . . . . . 9 (+g‘ndx) ≠ (Base‘ndx)
8685a1i 11 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (+g‘ndx) ≠ (Base‘ndx))
87 tsetndx 17297 . . . . . . . . . 10 (TopSet‘ndx) = 9
88 1re 11214 . . . . . . . . . . . 12 1 ∈ ℝ
89 1lt9 12418 . . . . . . . . . . . 12 1 < 9
9088, 89gtneii 11326 . . . . . . . . . . 11 9 ≠ 1
91 df-base 17145 . . . . . . . . . . . 12 Base = Slot 1
92 1nn 12223 . . . . . . . . . . . 12 1 ∈ ℕ
9391, 92ndxarg 17129 . . . . . . . . . . 11 (Base‘ndx) = 1
9490, 93neeqtrri 3015 . . . . . . . . . 10 9 ≠ (Base‘ndx)
9587, 94eqnetri 3012 . . . . . . . . 9 (TopSet‘ndx) ≠ (Base‘ndx)
9695a1i 11 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (TopSet‘ndx) ≠ (Base‘ndx))
9775, 76, 77, 81, 83, 86, 96tpres 7202 . . . . . . 7 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → ({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) = {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
9897uneq1d 4163 . . . . . 6 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (({⟨(Base‘ndx), 𝑀⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}) = ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}))
99 uncom 4154 . . . . . . . 8 ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}) = ({⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩} ∪ {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
100 tpass 4757 . . . . . . . 8 {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = ({⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩} ∪ {⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
10199, 100eqtr4i 2764 . . . . . . 7 ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}) = {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}
1025, 56symgbasmap 19244 . . . . . . . . . . . 12 (𝑥𝐵𝑥 ∈ (𝐴m 𝐴))
103102a1i 11 . . . . . . . . . . 11 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (𝑥𝐵𝑥 ∈ (𝐴m 𝐴)))
104103ssrdv 3989 . . . . . . . . . 10 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → 𝐵 ⊆ (𝐴m 𝐴))
105 df-ss 3966 . . . . . . . . . 10 (𝐵 ⊆ (𝐴m 𝐴) ↔ (𝐵 ∩ (𝐴m 𝐴)) = 𝐵)
106104, 105sylib 217 . . . . . . . . 9 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (𝐵 ∩ (𝐴m 𝐴)) = 𝐵)
107106opeq2d 4881 . . . . . . . 8 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → ⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩ = ⟨(Base‘ndx), 𝐵⟩)
108107tpeq1d 4750 . . . . . . 7 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
109101, 108eqtrid 2785 . . . . . 6 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → ({⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩} ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}) = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
11074, 98, 1093eqtrd 2777 . . . . 5 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → (((EndoFMnd‘𝐴) ↾ (V ∖ {(Base‘ndx)})) ∪ {⟨(Base‘ndx), (𝐵 ∩ (𝐴m 𝐴))⟩}) = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
11167, 71, 1103eqtrd 2777 . . . 4 ((𝐴𝑉 ∧ 1 < (♯‘𝐴)) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
112111ex 414 . . 3 (𝐴𝑉 → (1 < (♯‘𝐴) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
11334, 53, 1123jaod 1429 . 2 (𝐴𝑉 → (((♯‘𝐴) = 0 ∨ (♯‘𝐴) = 1 ∨ 1 < (♯‘𝐴)) → 𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩}))
1141, 113mpd 15 1 (𝐴𝑉𝐺 = {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(TopSet‘ndx), 𝐽⟩})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397  w3o 1087   = wceq 1542  wex 1782  wcel 2107  {cab 2710  wne 2941  Vcvv 3475  cdif 3946  cun 3947  cin 3948  wss 3949  wpss 3950  c0 4323  𝒫 cpw 4603  {csn 4629  {cpr 4631  {ctp 4633  cop 4635   class class class wbr 5149   × cxp 5675  cres 5679  ccom 5681  1-1-ontowf1o 6543  cfv 6544  (class class class)co 7409  cmpo 7411  m cmap 8820  0cc0 11110  1c1 11111   < clt 11248  9c9 12274  chash 14290   sSet csts 17096  ndxcnx 17126  Basecbs 17144  +gcplusg 17197  TopSetcts 17203  tcpt 17384  EndoFMndcefmnd 18749  SymGrpcsymg 19234
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725  ax-cnex 11166  ax-resscn 11167  ax-1cn 11168  ax-icn 11169  ax-addcl 11170  ax-addrcl 11171  ax-mulcl 11172  ax-mulrcl 11173  ax-mulcom 11174  ax-addass 11175  ax-mulass 11176  ax-distr 11177  ax-i2m1 11178  ax-1ne0 11179  ax-1rid 11180  ax-rnegex 11181  ax-rrecex 11182  ax-cnre 11183  ax-pre-lttri 11184  ax-pre-lttrn 11185  ax-pre-ltadd 11186  ax-pre-mulgt0 11187
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-tp 4634  df-op 4636  df-uni 4910  df-int 4952  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-riota 7365  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7856  df-1st 7975  df-2nd 7976  df-frecs 8266  df-wrecs 8297  df-recs 8371  df-rdg 8410  df-1o 8466  df-oadd 8470  df-er 8703  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-dju 9896  df-card 9934  df-pnf 11250  df-mnf 11251  df-xr 11252  df-ltxr 11253  df-le 11254  df-sub 11446  df-neg 11447  df-nn 12213  df-2 12275  df-3 12276  df-4 12277  df-5 12278  df-6 12279  df-7 12280  df-8 12281  df-9 12282  df-n0 12473  df-xnn0 12545  df-z 12559  df-uz 12823  df-fz 13485  df-hash 14291  df-struct 17080  df-sets 17097  df-slot 17115  df-ndx 17127  df-base 17145  df-ress 17174  df-plusg 17210  df-tset 17216  df-efmnd 18750  df-symg 19235
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator