Theorem sratsetg 14524

Description: Topology component of a subring algebra. (Contributed by Mario Carneiro, 4-Oct-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Revised by AV, 29-Oct-2024.)

Hypotheses

Ref	Expression
srapart.a	|- ( ph -> A = ( (subringAlg ` W ) ` S ) )
srapart.s	|- ( ph -> S C_ ( Base ` W ) )
srapart.ex	|- ( ph -> W e. X )

Assertion

Ref	Expression
sratsetg	|- ( ph -> (TopSet ` W ) = (TopSet ` A ) )

Proof of Theorem sratsetg

Step	Hyp	Ref	Expression
1		srapart.a	. 2 |- ( ph -> A = ( (subringAlg ` W ) ` S ) )
2		srapart.s	. 2 |- ( ph -> S C_ ( Base ` W ) )
3		srapart.ex	. 2 |- ( ph -> W e. X )
4		tsetslid 13334	. 2 |- (TopSet = Slot (TopSet ` ndx ) /\ (TopSet ` ndx ) e. NN )
5		slotstnscsi 13341	. . . 4 |- ( (TopSet ` ndx ) =/= (Scalar ` ndx ) /\ (TopSet ` ndx ) =/= ( .s ` ndx ) /\ (TopSet ` ndx ) =/= ( .i ` ndx ) )
6	5	simp1i 1033	. . 3 |- (TopSet ` ndx ) =/= (Scalar ` ndx )
7	6	necomi 2488	. 2 |- (Scalar ` ndx ) =/= (TopSet ` ndx )
8	5	simp2i 1034	. . 3 |- (TopSet ` ndx ) =/= ( .s ` ndx )
9	8	necomi 2488	. 2 |- ( .s ` ndx ) =/= (TopSet ` ndx )
10	5	simp3i 1035	. . 3 |- (TopSet ` ndx ) =/= ( .i ` ndx )
11	10	necomi 2488	. 2 |- ( .i ` ndx ) =/= (TopSet ` ndx )
12	1, 2, 3, 4, 7, 9, 11	sralemg 14517	1 |- ( ph -> (TopSet ` W ) = (TopSet ` A ) )

Syntax hints:   -> wi 4   = wceq 1398   e. wcel 2202   =/= wne 2403   C_ wss 3201   ` cfv 5333   ndxcnx 13142   Basecbs 13145  Scalarcsca 13226   .scvsca 13227   .icip 13228  TopSetcts 13229  subringAlg csra 14512

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-lttrn 8189  ax-pre-ltadd 8191

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-7 9249  df-8 9250  df-9 9251  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-mulr 13237  df-sca 13239  df-vsca 13240  df-ip 13241  df-tset 13242  df-sra 14514

This theorem is referenced by:  sratopng  14526