Theorem slotstnscsi 13549

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

Step	Hyp	Ref	Expression
1		5re 9383	. . . 4 |- 5 e. RR
2		5lt9 9505	. . . 4 |- 5 < 9
3	1, 2	gtneii 8421	. . 3 |- 9 =/= 5
4		tsetndx 13540	. . . 4 |- (TopSet ` ndx ) = 9
5		scandx 13505	. . . 4 |- (Scalar ` ndx ) = 5
6	4, 5	neeq12i 2437	. . 3 |- ( (TopSet ` ndx ) =/= (Scalar ` ndx ) <-> 9 =/= 5 )
7	3, 6	mpbir 146	. 2 |- (TopSet ` ndx ) =/= (Scalar ` ndx )
8		6re 9385	. . . 4 |- 6 e. RR
9		6lt9 9504	. . . 4 |- 6 < 9
10	8, 9	gtneii 8421	. . 3 |- 9 =/= 6
11		vscandx 13511	. . . 4 |- ( .s ` ndx ) = 6
12	4, 11	neeq12i 2437	. . 3 |- ( (TopSet ` ndx ) =/= ( .s ` ndx ) <-> 9 =/= 6 )
13	10, 12	mpbir 146	. 2 |- (TopSet ` ndx ) =/= ( .s ` ndx )
14		8re 9389	. . . 4 |- 8 e. RR
15		8lt9 9502	. . . 4 |- 8 < 9
16	14, 15	gtneii 8421	. . 3 |- 9 =/= 8
17		ipndx 13523	. . . 4 |- ( .i ` ndx ) = 8
18	4, 17	neeq12i 2437	. . 3 |- ( (TopSet ` ndx ) =/= ( .i ` ndx ) <-> 9 =/= 8 )
19	16, 18	mpbir 146	. 2 |- (TopSet ` ndx ) =/= ( .i ` ndx )
20	7, 13, 19	3pm3.2i 1206	1 |- ( (TopSet ` ndx ) =/= (Scalar ` ndx ) /\ (TopSet ` ndx ) =/= ( .s ` ndx ) /\ (TopSet ` ndx ) =/= ( .i ` ndx ) )

This proof depends on syntax axioms:   /\ w3a 1009   =/= wne 2420   ` cfv 5377   5c5 9358   6c6 9359   8c8 9361   9c9 9362   ndxcnx 13349  Scalarcsca 13434   .scvsca 13435   .icip 13436  TopSetcts 13437

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-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-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  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-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  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-sca 13447  df-vsca 13448  df-ip 13449  df-tset 13450

This theorem is used by:  sratsetg  14782