| 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 21328. (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 12223 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 2 | 1nn 12160 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 3 | 3nn0 12423 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
| 4 | 2nn0 12422 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 5 | 2lt10 12749 | . . . . . 6 ⊢ 2 < ;10 | |
| 6 | 2, 3, 4, 5 | declti 12649 | . . . . 5 ⊢ 2 < ;13 |
| 7 | 1, 6 | ltneii 11250 | . . . 4 ⊢ 2 ≠ ;13 |
| 8 | plusgndx 17207 | . . . . 5 ⊢ (+g‘ndx) = 2 | |
| 9 | unifndx 17319 | . . . . 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 12229 | . . . . 5 ⊢ 3 ∈ ℝ | |
| 13 | 3lt10 12748 | . . . . . 6 ⊢ 3 < ;10 | |
| 14 | 2, 3, 3, 13 | declti 12649 | . . . . 5 ⊢ 3 < ;13 |
| 15 | 12, 14 | ltneii 11250 | . . . 4 ⊢ 3 ≠ ;13 |
| 16 | mulrndx 17218 | . . . . 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 12233 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 20 | 4nn0 12424 | . . . . . 6 ⊢ 4 ∈ ℕ0 | |
| 21 | 4lt10 12747 | . . . . . 6 ⊢ 4 < ;10 | |
| 22 | 2, 3, 20, 21 | declti 12649 | . . . . 5 ⊢ 4 < ;13 |
| 23 | 19, 22 | ltneii 11250 | . . . 4 ⊢ 4 ≠ ;13 |
| 24 | starvndx 17226 | . . . . 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 12630 | . . . . 5 ⊢ ;10 ∈ ℝ | |
| 29 | 1nn0 12421 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 30 | 0nn0 12420 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 31 | 3nn 12228 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 32 | 3pos 12254 | . . . . . 6 ⊢ 0 < 3 | |
| 33 | 29, 30, 31, 32 | declt 12639 | . . . . 5 ⊢ ;10 < ;13 |
| 34 | 28, 33 | ltneii 11250 | . . . 4 ⊢ ;10 ≠ ;13 |
| 35 | plendx 17290 | . . . . 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 12222 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 39 | 29, 38 | decnncl 12631 | . . . . . 6 ⊢ ;12 ∈ ℕ |
| 40 | 39 | nnrei 12158 | . . . . 5 ⊢ ;12 ∈ ℝ |
| 41 | 2lt3 12316 | . . . . . 6 ⊢ 2 < 3 | |
| 42 | 29, 4, 31, 41 | declt 12639 | . . . . 5 ⊢ ;12 < ;13 |
| 43 | 40, 42 | ltneii 11250 | . . . 4 ⊢ ;12 ≠ ;13 |
| 44 | dsndx 17309 | . . . . 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 6493 0cc0 11030 1c1 11031 2c2 12204 3c3 12205 4c4 12206 ;cdc 12611 ndxcnx 17124 +gcplusg 17181 .rcmulr 17182 *𝑟cstv 17183 lecple 17188 distcds 17190 UnifSetcunif 17191 |
| 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 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| 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 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-3 12213 df-4 12214 df-5 12215 df-6 12216 df-7 12217 df-8 12218 df-9 12219 df-n0 12406 df-z 12493 df-dec 12612 df-slot 17113 df-ndx 17125 df-plusg 17194 df-mulr 17195 df-starv 17196 df-ple 17201 df-ds 17203 df-unif 17204 |
| This theorem is referenced by: cnfldfunALT 21328 cnfldfunALTOLD 21341 |
| Copyright terms: Public domain | W3C validator |