ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sratsetg Unicode version

Theorem sratsetg 13925
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
StepHypRef 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 12795 . 2  |-  (TopSet  = Slot  (TopSet `  ndx )  /\  (TopSet `  ndx )  e.  NN )
5 slotstnscsi 12802 . . . 4  |-  ( (TopSet `  ndx )  =/=  (Scalar ` 
ndx )  /\  (TopSet ` 
ndx )  =/=  ( .s `  ndx )  /\  (TopSet `  ndx )  =/=  ( .i `  ndx ) )
65simp1i 1008 . . 3  |-  (TopSet `  ndx )  =/=  (Scalar ` 
ndx )
76necomi 2449 . 2  |-  (Scalar `  ndx )  =/=  (TopSet ` 
ndx )
85simp2i 1009 . . 3  |-  (TopSet `  ndx )  =/=  ( .s `  ndx )
98necomi 2449 . 2  |-  ( .s
`  ndx )  =/=  (TopSet ` 
ndx )
105simp3i 1010 . . 3  |-  (TopSet `  ndx )  =/=  ( .i `  ndx )
1110necomi 2449 . 2  |-  ( .i
`  ndx )  =/=  (TopSet ` 
ndx )
121, 2, 3, 4, 7, 9, 11sralemg 13918 1  |-  ( ph  ->  (TopSet `  W )  =  (TopSet `  A )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2164    =/= wne 2364    C_ wss 3153   ` cfv 5246   ndxcnx 12605   Basecbs 12608  Scalarcsca 12688   .scvsca 12689   .icip 12690  TopSetcts 12691  subringAlg csra 13913
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4462  ax-setind 4565  ax-cnex 7953  ax-resscn 7954  ax-1cn 7955  ax-1re 7956  ax-icn 7957  ax-addcl 7958  ax-addrcl 7959  ax-mulcl 7960  ax-addcom 7962  ax-addass 7964  ax-i2m1 7967  ax-0lt1 7968  ax-0id 7970  ax-rnegex 7971  ax-pre-ltirr 7974  ax-pre-lttrn 7976  ax-pre-ltadd 7978
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4322  df-xp 4661  df-rel 4662  df-cnv 4663  df-co 4664  df-dm 4665  df-rn 4666  df-res 4667  df-ima 4668  df-iota 5207  df-fun 5248  df-fn 5249  df-f 5250  df-f1 5251  df-fo 5252  df-f1o 5253  df-fv 5254  df-ov 5913  df-oprab 5914  df-mpo 5915  df-pnf 8046  df-mnf 8047  df-ltxr 8049  df-inn 8973  df-2 9031  df-3 9032  df-4 9033  df-5 9034  df-6 9035  df-7 9036  df-8 9037  df-9 9038  df-ndx 12611  df-slot 12612  df-base 12614  df-sets 12615  df-iress 12616  df-mulr 12699  df-sca 12701  df-vsca 12702  df-ip 12703  df-tset 12704  df-sra 13915
This theorem is referenced by:  sratopng  13927
  Copyright terms: Public domain W3C validator