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

Theorem slotstnscsi 13296
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 9222 . . . 4  |-  5  e.  RR
2 5lt9 9344 . . . 4  |-  5  <  9
31, 2gtneii 8275 . . 3  |-  9  =/=  5
4 tsetndx 13287 . . . 4  |-  (TopSet `  ndx )  =  9
5 scandx 13252 . . . 4  |-  (Scalar `  ndx )  =  5
64, 5neeq12i 2419 . . 3  |-  ( (TopSet `  ndx )  =/=  (Scalar ` 
ndx )  <->  9  =/=  5 )
73, 6mpbir 146 . 2  |-  (TopSet `  ndx )  =/=  (Scalar ` 
ndx )
8 6re 9224 . . . 4  |-  6  e.  RR
9 6lt9 9343 . . . 4  |-  6  <  9
108, 9gtneii 8275 . . 3  |-  9  =/=  6
11 vscandx 13258 . . . 4  |-  ( .s
`  ndx )  =  6
124, 11neeq12i 2419 . . 3  |-  ( (TopSet `  ndx )  =/=  ( .s `  ndx )  <->  9  =/=  6 )
1310, 12mpbir 146 . 2  |-  (TopSet `  ndx )  =/=  ( .s `  ndx )
14 8re 9228 . . . 4  |-  8  e.  RR
15 8lt9 9341 . . . 4  |-  8  <  9
1614, 15gtneii 8275 . . 3  |-  9  =/=  8
17 ipndx 13270 . . . 4  |-  ( .i
`  ndx )  =  8
184, 17neeq12i 2419 . . 3  |-  ( (TopSet `  ndx )  =/=  ( .i `  ndx )  <->  9  =/=  8 )
1916, 18mpbir 146 . 2  |-  (TopSet `  ndx )  =/=  ( .i `  ndx )
207, 13, 193pm3.2i 1201 1  |-  ( (TopSet `  ndx )  =/=  (Scalar ` 
ndx )  /\  (TopSet ` 
ndx )  =/=  ( .s `  ndx )  /\  (TopSet `  ndx )  =/=  ( .i `  ndx ) )
Colors of variables: wff set class
Syntax hints:    /\ w3a 1004    =/= wne 2402   ` cfv 5326   5c5 9197   6c6 9198   8c8 9200   9c9 9201   ndxcnx 13097  Scalarcsca 13181   .scvsca 13182   .icip 13183  TopSetcts 13184
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6021  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-7 9207  df-8 9208  df-9 9209  df-ndx 13103  df-slot 13104  df-sca 13194  df-vsca 13195  df-ip 13196  df-tset 13197
This theorem is referenced by:  sratsetg  14478
  Copyright terms: Public domain W3C validator