| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > slotsdifunifndx | GIF version | ||
| Description: The index of the slot for the uniform set is not the index of other slots. (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 9383 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 2 | 1nn 9324 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 3 | 3nn0 9592 | . . . . . 6 ⊢ 3 ∈ ℕ0 | |
| 4 | 2nn0 9591 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 5 | 2lt10 9930 | . . . . . 6 ⊢ 2 < ;10 | |
| 6 | 2, 3, 4, 5 | declti 9830 | . . . . 5 ⊢ 2 < ;13 |
| 7 | 1, 6 | ltneii 8429 | . . . 4 ⊢ 2 ≠ ;13 |
| 8 | plusgndx 13522 | . . . . 5 ⊢ (+g‘ndx) = 2 | |
| 9 | unifndx 13639 | . . . . 5 ⊢ (UnifSet‘ndx) = ;13 | |
| 10 | 8, 9 | neeq12i 2437 | . . . 4 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ↔ 2 ≠ ;13) |
| 11 | 7, 10 | mpbir 146 | . . 3 ⊢ (+g‘ndx) ≠ (UnifSet‘ndx) |
| 12 | 3re 9387 | . . . . 5 ⊢ 3 ∈ ℝ | |
| 13 | 3lt10 9929 | . . . . . 6 ⊢ 3 < ;10 | |
| 14 | 2, 3, 3, 13 | declti 9830 | . . . . 5 ⊢ 3 < ;13 |
| 15 | 12, 14 | ltneii 8429 | . . . 4 ⊢ 3 ≠ ;13 |
| 16 | mulrndx 13543 | . . . . 5 ⊢ (.r‘ndx) = 3 | |
| 17 | 16, 9 | neeq12i 2437 | . . . 4 ⊢ ((.r‘ndx) ≠ (UnifSet‘ndx) ↔ 3 ≠ ;13) |
| 18 | 15, 17 | mpbir 146 | . . 3 ⊢ (.r‘ndx) ≠ (UnifSet‘ndx) |
| 19 | 4re 9390 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 20 | 4nn0 9593 | . . . . . 6 ⊢ 4 ∈ ℕ0 | |
| 21 | 4lt10 9928 | . . . . . 6 ⊢ 4 < ;10 | |
| 22 | 2, 3, 20, 21 | declti 9830 | . . . . 5 ⊢ 4 < ;13 |
| 23 | 19, 22 | ltneii 8429 | . . . 4 ⊢ 4 ≠ ;13 |
| 24 | starvndx 13552 | . . . . 5 ⊢ (*𝑟‘ndx) = 4 | |
| 25 | 24, 9 | neeq12i 2437 | . . . 4 ⊢ ((*𝑟‘ndx) ≠ (UnifSet‘ndx) ↔ 4 ≠ ;13) |
| 26 | 23, 25 | mpbir 146 | . . 3 ⊢ (*𝑟‘ndx) ≠ (UnifSet‘ndx) |
| 27 | 11, 18, 26 | 3pm3.2i 1206 | . 2 ⊢ ((+g‘ndx) ≠ (UnifSet‘ndx) ∧ (.r‘ndx) ≠ (UnifSet‘ndx) ∧ (*𝑟‘ndx) ≠ (UnifSet‘ndx)) |
| 28 | 10re 9810 | . . . . 5 ⊢ ;10 ∈ ℝ | |
| 29 | 1nn0 9590 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 30 | 0nn0 9589 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 31 | 3nn 9478 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 32 | 3pos 9407 | . . . . . 6 ⊢ 0 < 3 | |
| 33 | 29, 30, 31, 32 | declt 9820 | . . . . 5 ⊢ ;10 < ;13 |
| 34 | 28, 33 | ltneii 8429 | . . . 4 ⊢ ;10 ≠ ;13 |
| 35 | plendx 13613 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 36 | 35, 9 | neeq12i 2437 | . . . 4 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ↔ ;10 ≠ ;13) |
| 37 | 34, 36 | mpbir 146 | . . 3 ⊢ (le‘ndx) ≠ (UnifSet‘ndx) |
| 38 | 2nn 9477 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 39 | 29, 38 | decnncl 9811 | . . . . . 6 ⊢ ;12 ∈ ℕ |
| 40 | 39 | nnrei 9322 | . . . . 5 ⊢ ;12 ∈ ℝ |
| 41 | 2lt3 9486 | . . . . . 6 ⊢ 2 < 3 | |
| 42 | 29, 4, 31, 41 | declt 9820 | . . . . 5 ⊢ ;12 < ;13 |
| 43 | 40, 42 | ltneii 8429 | . . . 4 ⊢ ;12 ≠ ;13 |
| 44 | dsndx 13628 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 45 | 44, 9 | neeq12i 2437 | . . . 4 ⊢ ((dist‘ndx) ≠ (UnifSet‘ndx) ↔ ;12 ≠ ;13) |
| 46 | 43, 45 | mpbir 146 | . . 3 ⊢ (dist‘ndx) ≠ (UnifSet‘ndx) |
| 47 | 37, 46 | pm3.2i 272 | . 2 ⊢ ((le‘ndx) ≠ (UnifSet‘ndx) ∧ (dist‘ndx) ≠ (UnifSet‘ndx)) |
| 48 | 27, 47 | pm3.2i 272 | 1 ⊢ (((+g‘ndx) ≠ (UnifSet‘ndx) ∧ (.r‘ndx) ≠ (UnifSet‘ndx) ∧ (*𝑟‘ndx) ≠ (UnifSet‘ndx)) ∧ ((le‘ndx) ≠ (UnifSet‘ndx) ∧ (dist‘ndx) ≠ (UnifSet‘ndx))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 ∧ w3a 1009 ≠ wne 2420 ‘cfv 5380 0cc0 8185 1c1 8186 2c2 9364 3c3 9365 4c4 9366 ;cdc 9788 ndxcnx 13407 +gcplusg 13490 .rcmulr 13491 *𝑟cstv 13492 lecple 13497 distcds 13499 UnifSetcunif 13500 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-5 9375 df-6 9376 df-7 9377 df-8 9378 df-9 9379 df-n0 9575 df-z 9656 df-dec 9789 df-ndx 13413 df-slot 13414 df-plusg 13503 df-mulr 13504 df-starv 13505 df-ple 13510 df-ds 13512 df-unif 13513 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |