Theorem sratsetg 14782

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 13542	. 2 |- (TopSet = Slot (TopSet ` ndx ) /\ (TopSet ` ndx ) e. NN )
5		slotstnscsi 13549	. . . 4 |- ( (TopSet ` ndx ) =/= (Scalar ` ndx ) /\ (TopSet ` ndx ) =/= ( .s ` ndx ) /\ (TopSet ` ndx ) =/= ( .i ` ndx ) )
6	5	simp1i 1037	. . 3 |- (TopSet ` ndx ) =/= (Scalar ` ndx )
7	6	necomi 2505	. 2 |- (Scalar ` ndx ) =/= (TopSet ` ndx )
8	5	simp2i 1038	. . 3 |- (TopSet ` ndx ) =/= ( .s ` ndx )
9	8	necomi 2505	. 2 |- ( .s ` ndx ) =/= (TopSet ` ndx )
10	5	simp3i 1039	. . 3 |- (TopSet ` ndx ) =/= ( .i ` ndx )
11	10	necomi 2505	. 2 |- ( .i ` ndx ) =/= (TopSet ` ndx )
12	1, 2, 3, 4, 7, 9, 11	sralemg 14775	1 |- ( ph -> (TopSet ` W ) = (TopSet ` A ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   =/= wne 2420   C_ wss 3220   ` cfv 5377   ndxcnx 13349   Basecbs 13352  Scalarcsca 13434   .scvsca 13435   .icip 13436  TopSetcts 13437  subringAlg csra 14770

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-mulr 13445  df-sca 13447  df-vsca 13448  df-ip 13449  df-tset 13450  df-sra 14772

This theorem is used by:  sratopng  14784