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

Theorem slotstnscsi 13268
Description: The slots Scalar,  .s and  .i are different from the slot TopSet. (Contributed by AV, 29-Oct-2024.)
Assertion
Ref Expression
slotstnscsi  |-  ( (TopSet `  ndx )  =/=  (Scalar ` 
ndx )  /\  (TopSet ` 
ndx )  =/=  ( .s `  ndx )  /\  (TopSet `  ndx )  =/=  ( .i `  ndx ) )

Proof of Theorem slotstnscsi
StepHypRef Expression
1 5re 9212 . . . 4  |-  5  e.  RR
2 5lt9 9334 . . . 4  |-  5  <  9
31, 2gtneii 8265 . . 3  |-  9  =/=  5
4 tsetndx 13259 . . . 4  |-  (TopSet `  ndx )  =  9
5 scandx 13224 . . . 4  |-  (Scalar `  ndx )  =  5
64, 5neeq12i 2417 . . 3  |-  ( (TopSet `  ndx )  =/=  (Scalar ` 
ndx )  <->  9  =/=  5 )
73, 6mpbir 146 . 2  |-  (TopSet `  ndx )  =/=  (Scalar ` 
ndx )
8 6re 9214 . . . 4  |-  6  e.  RR
9 6lt9 9333 . . . 4  |-  6  <  9
108, 9gtneii 8265 . . 3  |-  9  =/=  6
11 vscandx 13230 . . . 4  |-  ( .s
`  ndx )  =  6
124, 11neeq12i 2417 . . 3  |-  ( (TopSet `  ndx )  =/=  ( .s `  ndx )  <->  9  =/=  6 )
1310, 12mpbir 146 . 2  |-  (TopSet `  ndx )  =/=  ( .s `  ndx )
14 8re 9218 . . . 4  |-  8  e.  RR
15 8lt9 9331 . . . 4  |-  8  <  9
1614, 15gtneii 8265 . . 3  |-  9  =/=  8
17 ipndx 13242 . . . 4  |-  ( .i
`  ndx )  =  8
184, 17neeq12i 2417 . . 3  |-  ( (TopSet `  ndx )  =/=  ( .i `  ndx )  <->  9  =/=  8 )
1916, 18mpbir 146 . 2  |-  (TopSet `  ndx )  =/=  ( .i `  ndx )
207, 13, 193pm3.2i 1199 1  |-  ( (TopSet `  ndx )  =/=  (Scalar ` 
ndx )  /\  (TopSet ` 
ndx )  =/=  ( .s `  ndx )  /\  (TopSet `  ndx )  =/=  ( .i `  ndx ) )
Colors of variables: wff set class
Syntax hints:    /\ w3a 1002    =/= wne 2400   ` cfv 5324   5c5 9187   6c6 9188   8c8 9190   9c9 9191   ndxcnx 13069  Scalarcsca 13153   .scvsca 13154   .icip 13155  TopSetcts 13156
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-pre-ltirr 8134  ax-pre-lttrn 8136  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fun 5326  df-fv 5332  df-ov 6016  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-5 9195  df-6 9196  df-7 9197  df-8 9198  df-9 9199  df-ndx 13075  df-slot 13076  df-sca 13166  df-vsca 13167  df-ip 13168  df-tset 13169
This theorem is referenced by:  sratsetg  14449
  Copyright terms: Public domain W3C validator