| 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 21600. (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 12339 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 2 | 1nn 12268 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 3 | 3nn0 12546 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
| 4 | 2nn0 12545 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 5 | 2lt10 12880 | . . . . . 6 ⊢ 2 < ;10 | |
| 6 | 2, 3, 4, 5 | declti 12779 | . . . . 5 ⊢ 2 < ;13 |
| 7 | 1, 6 | ltneii 11347 | . . . 4 ⊢ 2 ≠ ;13 |
| 8 | plusgndx 17368 | . . . . 5 ⊢ (+g‘ndx) = 2 | |
| 9 | unifndx 17480 | . . . . 5 ⊢ (UnifSet‘ndx) = ;13 | |
| 10 | 8, 9 | neeq12i 3021 | . . . 4 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ↔ 2 ≠ ;13) |
| 11 | 7, 10 | mpbir 234 | . . 3 ⊢ (+g‘ndx) ≠ (UnifSet‘ndx) |
| 12 | 3re 12345 | . . . . 5 ⊢ 3 ∈ ℝ | |
| 13 | 3lt10 12879 | . . . . . 6 ⊢ 3 < ;10 | |
| 14 | 2, 3, 3, 13 | declti 12779 | . . . . 5 ⊢ 3 < ;13 |
| 15 | 12, 14 | ltneii 11347 | . . . 4 ⊢ 3 ≠ ;13 |
| 16 | mulrndx 17379 | . . . . 5 ⊢ (.r‘ndx) = 3 | |
| 17 | 16, 9 | neeq12i 3021 | . . . 4 ⊢ ((.r‘ndx) ≠ (UnifSet‘ndx) ↔ 3 ≠ ;13) |
| 18 | 15, 17 | mpbir 234 | . . 3 ⊢ (.r‘ndx) ≠ (UnifSet‘ndx) |
| 19 | 4re 12349 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 20 | 4nn0 12547 | . . . . . 6 ⊢ 4 ∈ ℕ0 | |
| 21 | 4lt10 12878 | . . . . . 6 ⊢ 4 < ;10 | |
| 22 | 2, 3, 20, 21 | declti 12779 | . . . . 5 ⊢ 4 < ;13 |
| 23 | 19, 22 | ltneii 11347 | . . . 4 ⊢ 4 ≠ ;13 |
| 24 | starvndx 17387 | . . . . 5 ⊢ (*𝑟‘ndx) = 4 | |
| 25 | 24, 9 | neeq12i 3021 | . . . 4 ⊢ ((*𝑟‘ndx) ≠ (UnifSet‘ndx) ↔ 4 ≠ ;13) |
| 26 | 23, 25 | mpbir 234 | . . 3 ⊢ (*𝑟‘ndx) ≠ (UnifSet‘ndx) |
| 27 | 11, 18, 26 | 3pm3.2i 1358 | . 2 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ∧ (.r‘ndx) ≠ (UnifSet‘ndx) ∧ (*𝑟‘ndx) ≠ (UnifSet‘ndx)) |
| 28 | 10re 12759 | . . . . 5 ⊢ ;10 ∈ ℝ | |
| 29 | 1nn0 12544 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 30 | 0nn0 12543 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 31 | 3nn 12344 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 32 | 3pos 12373 | . . . . . 6 ⊢ 0 < 3 | |
| 33 | 29, 30, 31, 32 | declt 12769 | . . . . 5 ⊢ ;10 < ;13 |
| 34 | 28, 33 | ltneii 11347 | . . . 4 ⊢ ;10 ≠ ;13 |
| 35 | plendx 17451 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 36 | 35, 9 | neeq12i 3021 | . . . 4 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ↔ ;10 ≠ ;13) |
| 37 | 34, 36 | mpbir 234 | . . 3 ⊢ (le‘ndx) ≠ (UnifSet‘ndx) |
| 38 | 2nn 12338 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 39 | 29, 38 | decnncl 12760 | . . . . . 6 ⊢ ;12 ∈ ℕ |
| 40 | 39 | nnrei 12266 | . . . . 5 ⊢ ;12 ∈ ℝ |
| 41 | 2lt3 12438 | . . . . . 6 ⊢ 2 < 3 | |
| 42 | 29, 4, 31, 41 | declt 12769 | . . . . 5 ⊢ ;12 < ;13 |
| 43 | 40, 42 | ltneii 11347 | . . . 4 ⊢ ;12 ≠ ;13 |
| 44 | dsndx 17470 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 45 | 44, 9 | neeq12i 3021 | . . . 4 ⊢ ((dist‘ndx) ≠ (UnifSet‘ndx) ↔ ;12 ≠ ;13) |
| 46 | 43, 45 | mpbir 234 | . . 3 ⊢ (dist‘ndx) ≠ (UnifSet‘ndx) |
| 47 | 37, 46 | pm3.2i 476 | . 2 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ∧ (dist‘ndx) ≠ (UnifSet‘ndx)) |
| 48 | 27, 47 | pm3.2i 476 | 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 |
| This proof depends on syntax axioms: ∧ wa 401 ∧ w3a 1103 ≠ wne 2955 ‘cfv 6533 0cc0 11124 1c1 11125 2c2 12319 3c3 12320 4c4 12321 ;cdc 12736 ndxcnx 17285 +gcplusg 17342 .rcmulr 17343 *𝑟cstv 17344 lecple 17349 distcds 17351 UnifSetcunif 17352 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-slot 17274 df-ndx 17286 df-plusg 17355 df-mulr 17356 df-starv 17357 df-ple 17362 df-ds 17364 df-unif 17365 |
| This theorem is used by: cnfldfunALT 21600 |
| Copyright terms: Public domain | W3C validator |