| 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 21336. (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 12231 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 2 | 1nn 12168 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 3 | 3nn0 12431 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
| 4 | 2nn0 12430 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 5 | 2lt10 12757 | . . . . . 6 ⊢ 2 < ;10 | |
| 6 | 2, 3, 4, 5 | declti 12657 | . . . . 5 ⊢ 2 < ;13 |
| 7 | 1, 6 | ltneii 11258 | . . . 4 ⊢ 2 ≠ ;13 |
| 8 | plusgndx 17215 | . . . . 5 ⊢ (+g‘ndx) = 2 | |
| 9 | unifndx 17327 | . . . . 5 ⊢ (UnifSet‘ndx) = ;13 | |
| 10 | 8, 9 | neeq12i 2999 | . . . 4 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ↔ 2 ≠ ;13) |
| 11 | 7, 10 | mpbir 231 | . . 3 ⊢ (+g‘ndx) ≠ (UnifSet‘ndx) |
| 12 | 3re 12237 | . . . . 5 ⊢ 3 ∈ ℝ | |
| 13 | 3lt10 12756 | . . . . . 6 ⊢ 3 < ;10 | |
| 14 | 2, 3, 3, 13 | declti 12657 | . . . . 5 ⊢ 3 < ;13 |
| 15 | 12, 14 | ltneii 11258 | . . . 4 ⊢ 3 ≠ ;13 |
| 16 | mulrndx 17226 | . . . . 5 ⊢ (.r‘ndx) = 3 | |
| 17 | 16, 9 | neeq12i 2999 | . . . 4 ⊢ ((.r‘ndx) ≠ (UnifSet‘ndx) ↔ 3 ≠ ;13) |
| 18 | 15, 17 | mpbir 231 | . . 3 ⊢ (.r‘ndx) ≠ (UnifSet‘ndx) |
| 19 | 4re 12241 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 20 | 4nn0 12432 | . . . . . 6 ⊢ 4 ∈ ℕ0 | |
| 21 | 4lt10 12755 | . . . . . 6 ⊢ 4 < ;10 | |
| 22 | 2, 3, 20, 21 | declti 12657 | . . . . 5 ⊢ 4 < ;13 |
| 23 | 19, 22 | ltneii 11258 | . . . 4 ⊢ 4 ≠ ;13 |
| 24 | starvndx 17234 | . . . . 5 ⊢ (*𝑟‘ndx) = 4 | |
| 25 | 24, 9 | neeq12i 2999 | . . . 4 ⊢ ((*𝑟‘ndx) ≠ (UnifSet‘ndx) ↔ 4 ≠ ;13) |
| 26 | 23, 25 | mpbir 231 | . . 3 ⊢ (*𝑟‘ndx) ≠ (UnifSet‘ndx) |
| 27 | 11, 18, 26 | 3pm3.2i 1341 | . 2 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ∧ (.r‘ndx) ≠ (UnifSet‘ndx) ∧ (*𝑟‘ndx) ≠ (UnifSet‘ndx)) |
| 28 | 10re 12638 | . . . . 5 ⊢ ;10 ∈ ℝ | |
| 29 | 1nn0 12429 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 30 | 0nn0 12428 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 31 | 3nn 12236 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 32 | 3pos 12262 | . . . . . 6 ⊢ 0 < 3 | |
| 33 | 29, 30, 31, 32 | declt 12647 | . . . . 5 ⊢ ;10 < ;13 |
| 34 | 28, 33 | ltneii 11258 | . . . 4 ⊢ ;10 ≠ ;13 |
| 35 | plendx 17298 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 36 | 35, 9 | neeq12i 2999 | . . . 4 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ↔ ;10 ≠ ;13) |
| 37 | 34, 36 | mpbir 231 | . . 3 ⊢ (le‘ndx) ≠ (UnifSet‘ndx) |
| 38 | 2nn 12230 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 39 | 29, 38 | decnncl 12639 | . . . . . 6 ⊢ ;12 ∈ ℕ |
| 40 | 39 | nnrei 12166 | . . . . 5 ⊢ ;12 ∈ ℝ |
| 41 | 2lt3 12324 | . . . . . 6 ⊢ 2 < 3 | |
| 42 | 29, 4, 31, 41 | declt 12647 | . . . . 5 ⊢ ;12 < ;13 |
| 43 | 40, 42 | ltneii 11258 | . . . 4 ⊢ ;12 ≠ ;13 |
| 44 | dsndx 17317 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 45 | 44, 9 | neeq12i 2999 | . . . 4 ⊢ ((dist‘ndx) ≠ (UnifSet‘ndx) ↔ ;12 ≠ ;13) |
| 46 | 43, 45 | mpbir 231 | . . 3 ⊢ (dist‘ndx) ≠ (UnifSet‘ndx) |
| 47 | 37, 46 | pm3.2i 470 | . 2 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ∧ (dist‘ndx) ≠ (UnifSet‘ndx)) |
| 48 | 27, 47 | pm3.2i 470 | 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 395 ∧ w3a 1087 ≠ wne 2933 ‘cfv 6500 0cc0 11038 1c1 11039 2c2 12212 3c3 12213 4c4 12214 ;cdc 12619 ndxcnx 17132 +gcplusg 17189 .rcmulr 17190 *𝑟cstv 17191 lecple 17196 distcds 17198 UnifSetcunif 17199 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-slot 17121 df-ndx 17133 df-plusg 17202 df-mulr 17203 df-starv 17204 df-ple 17209 df-ds 17211 df-unif 17212 |
| This theorem is referenced by: cnfldfunALT 21336 cnfldfunALTOLD 21349 |
| Copyright terms: Public domain | W3C validator |