| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > slotsdifunifndx | Structured version Visualization version GIF version | ||
| Description: The index of the slot for the uniform set is not the index of other slots. Formerly part of proof for cnfldfunALT 21497. (Contributed by AV, 10-Nov-2024.) |
| Ref | Expression |
|---|---|
| slotsdifunifndx | ⊢ (((+g‘ndx) ≠ (UnifSet‘ndx) ∧ (.r‘ndx) ≠ (UnifSet‘ndx) ∧ (*𝑟‘ndx) ≠ (UnifSet‘ndx)) ∧ ((le‘ndx) ≠ (UnifSet‘ndx) ∧ (dist‘ndx) ≠ (UnifSet‘ndx))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2re 12306 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 2 | 1nn 12235 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 3 | 3nn0 12513 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
| 4 | 2nn0 12512 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 5 | 2lt10 12846 | . . . . . 6 ⊢ 2 < ;10 | |
| 6 | 2, 3, 4, 5 | declti 12745 | . . . . 5 ⊢ 2 < ;13 |
| 7 | 1, 6 | ltneii 11311 | . . . 4 ⊢ 2 ≠ ;13 |
| 8 | plusgndx 17326 | . . . . 5 ⊢ (+g‘ndx) = 2 | |
| 9 | unifndx 17438 | . . . . 5 ⊢ (UnifSet‘ndx) = ;13 | |
| 10 | 8, 9 | neeq12i 3026 | . . . 4 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ↔ 2 ≠ ;13) |
| 11 | 7, 10 | mpbir 234 | . . 3 ⊢ (+g‘ndx) ≠ (UnifSet‘ndx) |
| 12 | 3re 12312 | . . . . 5 ⊢ 3 ∈ ℝ | |
| 13 | 3lt10 12845 | . . . . . 6 ⊢ 3 < ;10 | |
| 14 | 2, 3, 3, 13 | declti 12745 | . . . . 5 ⊢ 3 < ;13 |
| 15 | 12, 14 | ltneii 11311 | . . . 4 ⊢ 3 ≠ ;13 |
| 16 | mulrndx 17337 | . . . . 5 ⊢ (.r‘ndx) = 3 | |
| 17 | 16, 9 | neeq12i 3026 | . . . 4 ⊢ ((.r‘ndx) ≠ (UnifSet‘ndx) ↔ 3 ≠ ;13) |
| 18 | 15, 17 | mpbir 234 | . . 3 ⊢ (.r‘ndx) ≠ (UnifSet‘ndx) |
| 19 | 4re 12316 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 20 | 4nn0 12514 | . . . . . 6 ⊢ 4 ∈ ℕ0 | |
| 21 | 4lt10 12844 | . . . . . 6 ⊢ 4 < ;10 | |
| 22 | 2, 3, 20, 21 | declti 12745 | . . . . 5 ⊢ 4 < ;13 |
| 23 | 19, 22 | ltneii 11311 | . . . 4 ⊢ 4 ≠ ;13 |
| 24 | starvndx 17345 | . . . . 5 ⊢ (*𝑟‘ndx) = 4 | |
| 25 | 24, 9 | neeq12i 3026 | . . . 4 ⊢ ((*𝑟‘ndx) ≠ (UnifSet‘ndx) ↔ 4 ≠ ;13) |
| 26 | 23, 25 | mpbir 234 | . . 3 ⊢ (*𝑟‘ndx) ≠ (UnifSet‘ndx) |
| 27 | 11, 18, 26 | 3pm3.2i 1356 | . 2 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ∧ (.r‘ndx) ≠ (UnifSet‘ndx) ∧ (*𝑟‘ndx) ≠ (UnifSet‘ndx)) |
| 28 | 10re 12725 | . . . . 5 ⊢ ;10 ∈ ℝ | |
| 29 | 1nn0 12511 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 30 | 0nn0 12510 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 31 | 3nn 12311 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 32 | 3pos 12340 | . . . . . 6 ⊢ 0 < 3 | |
| 33 | 29, 30, 31, 32 | declt 12735 | . . . . 5 ⊢ ;10 < ;13 |
| 34 | 28, 33 | ltneii 11311 | . . . 4 ⊢ ;10 ≠ ;13 |
| 35 | plendx 17409 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 36 | 35, 9 | neeq12i 3026 | . . . 4 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ↔ ;10 ≠ ;13) |
| 37 | 34, 36 | mpbir 234 | . . 3 ⊢ (le‘ndx) ≠ (UnifSet‘ndx) |
| 38 | 2nn 12305 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 39 | 29, 38 | decnncl 12726 | . . . . . 6 ⊢ ;12 ∈ ℕ |
| 40 | 39 | nnrei 12233 | . . . . 5 ⊢ ;12 ∈ ℝ |
| 41 | 2lt3 12405 | . . . . . 6 ⊢ 2 < 3 | |
| 42 | 29, 4, 31, 41 | declt 12735 | . . . . 5 ⊢ ;12 < ;13 |
| 43 | 40, 42 | ltneii 11311 | . . . 4 ⊢ ;12 ≠ ;13 |
| 44 | dsndx 17428 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 45 | 44, 9 | neeq12i 3026 | . . . 4 ⊢ ((dist‘ndx) ≠ (UnifSet‘ndx) ↔ ;12 ≠ ;13) |
| 46 | 43, 45 | mpbir 234 | . . 3 ⊢ (dist‘ndx) ≠ (UnifSet‘ndx) |
| 47 | 37, 46 | pm3.2i 475 | . 2 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ∧ (dist‘ndx) ≠ (UnifSet‘ndx)) |
| 48 | 27, 47 | pm3.2i 475 | 1 ⊢ (((+g‘ndx) ≠ (UnifSet‘ndx) ∧ (.r‘ndx) ≠ (UnifSet‘ndx) ∧ (*𝑟‘ndx) ≠ (UnifSet‘ndx)) ∧ ((le‘ndx) ≠ (UnifSet‘ndx) ∧ (dist‘ndx) ≠ (UnifSet‘ndx))) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 ∧ w3a 1101 ≠ wne 2960 ‘cfv 6525 0cc0 11088 1c1 11089 2c2 12286 3c3 12287 4c4 12288 ;cdc 12702 ndxcnx 17243 +gcplusg 17300 .rcmulr 17301 *𝑟cstv 17302 lecple 17307 distcds 17309 UnifSetcunif 17310 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-z 12583 df-dec 12703 df-slot 17232 df-ndx 17244 df-plusg 17313 df-mulr 17314 df-starv 17315 df-ple 17320 df-ds 17322 df-unif 17323 |
| This theorem is referenced by: cnfldfunALT 21497 |
| Copyright terms: Public domain | W3C validator |