| 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 21574. (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 12333 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 2 | 1nn 12262 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 3 | 3nn0 12540 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
| 4 | 2nn0 12539 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 5 | 2lt10 12873 | . . . . . 6 ⊢ 2 < ;10 | |
| 6 | 2, 3, 4, 5 | declti 12772 | . . . . 5 ⊢ 2 < ;13 |
| 7 | 1, 6 | ltneii 11341 | . . . 4 ⊢ 2 ≠ ;13 |
| 8 | plusgndx 17361 | . . . . 5 ⊢ (+g‘ndx) = 2 | |
| 9 | unifndx 17473 | . . . . 5 ⊢ (UnifSet‘ndx) = ;13 | |
| 10 | 8, 9 | neeq12i 3027 | . . . 4 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ↔ 2 ≠ ;13) |
| 11 | 7, 10 | mpbir 234 | . . 3 ⊢ (+g‘ndx) ≠ (UnifSet‘ndx) |
| 12 | 3re 12339 | . . . . 5 ⊢ 3 ∈ ℝ | |
| 13 | 3lt10 12872 | . . . . . 6 ⊢ 3 < ;10 | |
| 14 | 2, 3, 3, 13 | declti 12772 | . . . . 5 ⊢ 3 < ;13 |
| 15 | 12, 14 | ltneii 11341 | . . . 4 ⊢ 3 ≠ ;13 |
| 16 | mulrndx 17372 | . . . . 5 ⊢ (.r‘ndx) = 3 | |
| 17 | 16, 9 | neeq12i 3027 | . . . 4 ⊢ ((.r‘ndx) ≠ (UnifSet‘ndx) ↔ 3 ≠ ;13) |
| 18 | 15, 17 | mpbir 234 | . . 3 ⊢ (.r‘ndx) ≠ (UnifSet‘ndx) |
| 19 | 4re 12343 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 20 | 4nn0 12541 | . . . . . 6 ⊢ 4 ∈ ℕ0 | |
| 21 | 4lt10 12871 | . . . . . 6 ⊢ 4 < ;10 | |
| 22 | 2, 3, 20, 21 | declti 12772 | . . . . 5 ⊢ 4 < ;13 |
| 23 | 19, 22 | ltneii 11341 | . . . 4 ⊢ 4 ≠ ;13 |
| 24 | starvndx 17380 | . . . . 5 ⊢ (*𝑟‘ndx) = 4 | |
| 25 | 24, 9 | neeq12i 3027 | . . . 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 12752 | . . . . 5 ⊢ ;10 ∈ ℝ | |
| 29 | 1nn0 12538 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 30 | 0nn0 12537 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 31 | 3nn 12338 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 32 | 3pos 12367 | . . . . . 6 ⊢ 0 < 3 | |
| 33 | 29, 30, 31, 32 | declt 12762 | . . . . 5 ⊢ ;10 < ;13 |
| 34 | 28, 33 | ltneii 11341 | . . . 4 ⊢ ;10 ≠ ;13 |
| 35 | plendx 17444 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 36 | 35, 9 | neeq12i 3027 | . . . 4 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ↔ ;10 ≠ ;13) |
| 37 | 34, 36 | mpbir 234 | . . 3 ⊢ (le‘ndx) ≠ (UnifSet‘ndx) |
| 38 | 2nn 12332 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 39 | 29, 38 | decnncl 12753 | . . . . . 6 ⊢ ;12 ∈ ℕ |
| 40 | 39 | nnrei 12260 | . . . . 5 ⊢ ;12 ∈ ℝ |
| 41 | 2lt3 12432 | . . . . . 6 ⊢ 2 < 3 | |
| 42 | 29, 4, 31, 41 | declt 12762 | . . . . 5 ⊢ ;12 < ;13 |
| 43 | 40, 42 | ltneii 11341 | . . . 4 ⊢ ;12 ≠ ;13 |
| 44 | dsndx 17463 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 45 | 44, 9 | neeq12i 3027 | . . . 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 2961 ‘cfv 6543 0cc0 11118 1c1 11119 2c2 12313 3c3 12314 4c4 12315 ;cdc 12729 ndxcnx 17278 +gcplusg 17335 .rcmulr 17336 *𝑟cstv 17337 lecple 17342 distcds 17344 UnifSetcunif 17345 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-2 12321 df-3 12322 df-4 12323 df-5 12324 df-6 12325 df-7 12326 df-8 12327 df-9 12328 df-n0 12523 df-z 12610 df-dec 12730 df-slot 17267 df-ndx 17279 df-plusg 17348 df-mulr 17349 df-starv 17350 df-ple 17355 df-ds 17357 df-unif 17358 |
| This theorem is used by: cnfldfunALT 21574 |
| Copyright terms: Public domain | W3C validator |