| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > chnpolfz | Structured version Visualization version GIF version | ||
| Description: Provided that chain's relation is a partial order, the chain length is restricted to a specific integer range. (Contributed by Ender Ting, 20-Jan-2026.) |
| Ref | Expression |
|---|---|
| chnpolfz.1 | ⊢ (𝜑 → < Po 𝐴) |
| chnpolfz.2 | ⊢ (𝜑 → 𝐵 ∈ ( < Chain 𝐴)) |
| chnpolfz.3 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| Ref | Expression |
|---|---|
| chnpolfz | ⊢ (𝜑 → (♯‘𝐵) ∈ (0...(♯‘𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0zd 12566 | . 2 ⊢ (𝜑 → 0 ∈ ℤ) | |
| 2 | chnpolfz.3 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 3 | hashcl 14355 | . . . 4 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
| 4 | 2, 3 | syl 17 | . . 3 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ0) |
| 5 | 4 | nn0zd 12579 | . 2 ⊢ (𝜑 → (♯‘𝐴) ∈ ℤ) |
| 6 | chnpolfz.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ( < Chain 𝐴)) | |
| 7 | 6 | chnwrd 18612 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ Word 𝐴) |
| 8 | lencl 14532 | . . . 4 ⊢ (𝐵 ∈ Word 𝐴 → (♯‘𝐵) ∈ ℕ0) | |
| 9 | 7, 8 | syl 17 | . . 3 ⊢ (𝜑 → (♯‘𝐵) ∈ ℕ0) |
| 10 | 9 | nn0zd 12579 | . 2 ⊢ (𝜑 → (♯‘𝐵) ∈ ℤ) |
| 11 | hashge0 14386 | . . 3 ⊢ (𝐵 ∈ ( < Chain 𝐴) → 0 ≤ (♯‘𝐵)) | |
| 12 | 6, 11 | syl 17 | . 2 ⊢ (𝜑 → 0 ≤ (♯‘𝐵)) |
| 13 | chnpolfz.1 | . . 3 ⊢ (𝜑 → < Po 𝐴) | |
| 14 | 13, 6, 2 | chnpolleha 18636 | . 2 ⊢ (𝜑 → (♯‘𝐵) ≤ (♯‘𝐴)) |
| 15 | 1, 5, 10, 12, 14 | elfzd 13506 | 1 ⊢ (𝜑 → (♯‘𝐵) ∈ (0...(♯‘𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2132 class class class wbr 5090 Po wpo 5542 ‘cfv 6506 (class class class)co 7381 Fincfn 8912 0cc0 11059 ≤ cle 11203 ℕ0cn0 12467 ...cfz 13498 ♯chash 14329 Word cword 14512 Chain cchn 18609 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-1o 8421 df-2o 8422 df-oadd 8425 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-dju 9845 df-card 9883 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-nn 12197 df-2 12266 df-n0 12468 df-xnn0 12541 df-z 12555 df-uz 12826 df-rp 12980 df-fz 13499 df-fzo 13646 df-hash 14330 df-word 14513 df-lsw 14562 df-concat 14570 df-s1 14596 df-substr 14641 df-pfx 14671 df-chn 18610 |
| This theorem is referenced by: chnfi 18638 |
| Copyright terms: Public domain | W3C validator |