| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > trlsegvdeglem6 | GIF version | ||
| Description: Lemma for trlsegvdeg . (Contributed by AV, 21-Feb-2021.) |
| Ref | Expression |
|---|---|
| trlsegvdeg.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| trlsegvdeg.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| trlsegvdeg.f | ⊢ (𝜑 → Fun 𝐼) |
| trlsegvdeg.n | ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) |
| trlsegvdeg.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
| trlsegvdeg.w | ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| trlsegvdeg.vx | ⊢ (𝜑 → (Vtx‘𝑋) = 𝑉) |
| trlsegvdeg.vy | ⊢ (𝜑 → (Vtx‘𝑌) = 𝑉) |
| trlsegvdeg.vz | ⊢ (𝜑 → (Vtx‘𝑍) = 𝑉) |
| trlsegvdeg.ix | ⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| trlsegvdeg.iy | ⊢ (𝜑 → (iEdg‘𝑌) = {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉}) |
| trlsegvdeg.iz | ⊢ (𝜑 → (iEdg‘𝑍) = (𝐼 ↾ (𝐹 “ (0...𝑁)))) |
| Ref | Expression |
|---|---|
| trlsegvdeglem6 | ⊢ (𝜑 → dom (iEdg‘𝑋) ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | trlsegvdeg.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | trlsegvdeg.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | trlsegvdeg.f | . . . 4 ⊢ (𝜑 → Fun 𝐼) | |
| 4 | trlsegvdeg.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 5 | trlsegvdeg.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
| 6 | trlsegvdeg.w | . . . 4 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) | |
| 7 | trlsegvdeg.vx | . . . 4 ⊢ (𝜑 → (Vtx‘𝑋) = 𝑉) | |
| 8 | trlsegvdeg.vy | . . . 4 ⊢ (𝜑 → (Vtx‘𝑌) = 𝑉) | |
| 9 | trlsegvdeg.vz | . . . 4 ⊢ (𝜑 → (Vtx‘𝑍) = 𝑉) | |
| 10 | trlsegvdeg.ix | . . . 4 ⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))) | |
| 11 | trlsegvdeg.iy | . . . 4 ⊢ (𝜑 → (iEdg‘𝑌) = {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉}) | |
| 12 | trlsegvdeg.iz | . . . 4 ⊢ (𝜑 → (iEdg‘𝑍) = (𝐼 ↾ (𝐹 “ (0...𝑁)))) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | trlsegvdeglem4 16584 | . . 3 ⊢ (𝜑 → dom (iEdg‘𝑋) = ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) |
| 14 | 2 | trlf1 16509 | . . . . . . 7 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 15 | 6, 14 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 16 | f1f 5578 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 17 | 15, 16 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
| 18 | 17 | fimassd 5531 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 19 | dfss2 3231 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) = (𝐹 “ (0..^𝑁))) | |
| 20 | 18, 19 | sylib 122 | . . 3 ⊢ (𝜑 → ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) = (𝐹 “ (0..^𝑁))) |
| 21 | 13, 20 | eqtrd 2267 | . 2 ⊢ (𝜑 → dom (iEdg‘𝑋) = (𝐹 “ (0..^𝑁))) |
| 22 | elfzoelz 10503 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ ℤ) | |
| 23 | 4, 22 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 24 | elfzoel2 10502 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ ℤ) | |
| 25 | 4, 24 | syl 14 | . . . . 5 ⊢ (𝜑 → (♯‘𝐹) ∈ ℤ) |
| 26 | elfzo0le 10546 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ≤ (♯‘𝐹)) | |
| 27 | 4, 26 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ≤ (♯‘𝐹)) |
| 28 | eluz2 9877 | . . . . 5 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ (♯‘𝐹) ∈ ℤ ∧ 𝑁 ≤ (♯‘𝐹))) | |
| 29 | 23, 25, 27, 28 | syl3anbrc 1208 | . . . 4 ⊢ (𝜑 → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) |
| 30 | fzoss2 10530 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 31 | 29, 30 | syl 14 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 32 | 0z 9605 | . . . 4 ⊢ 0 ∈ ℤ | |
| 33 | fzofig 10818 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin) | |
| 34 | 32, 23, 33 | sylancr 414 | . . 3 ⊢ (𝜑 → (0..^𝑁) ∈ Fin) |
| 35 | imaf1fi 7206 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹)) ∧ (0..^𝑁) ∈ Fin) → (𝐹 “ (0..^𝑁)) ∈ Fin) | |
| 36 | 15, 31, 34, 35 | syl3anc 1274 | . 2 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ∈ Fin) |
| 37 | 21, 36 | eqeltrd 2311 | 1 ⊢ (𝜑 → dom (iEdg‘𝑋) ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 ∩ cin 3213 ⊆ wss 3214 {csn 3694 〈cop 3697 class class class wbr 4114 dom cdm 4754 ↾ cres 4756 “ cima 4757 Fun wfun 5351 ⟶wf 5353 –1-1→wf1 5354 ‘cfv 5357 (class class class)co 6058 Fincfn 6988 0cc0 8143 ≤ cle 8325 ℤcz 9594 ℤ≥cuz 9871 ...cfz 10361 ..^cfzo 10498 ♯chash 11163 Vtxcvtx 16133 iEdgciedg 16134 Trailsctrls 16501 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-ifp 987 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-1o 6660 df-er 6780 df-map 6897 df-en 6989 df-dom 6990 df-fin 6991 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-inn 9255 df-2 9313 df-3 9314 df-4 9315 df-5 9316 df-6 9317 df-7 9318 df-8 9319 df-9 9320 df-n0 9514 df-z 9595 df-dec 9728 df-uz 9872 df-fz 10362 df-fzo 10499 df-ihash 11164 df-word 11250 df-ndx 13299 df-slot 13300 df-base 13302 df-edgf 16126 df-vtx 16135 df-iedg 16136 df-wlks 16439 df-trls 16502 |
| This theorem is referenced by: trlsegvdegfi 16588 eupth2lem3lem1fi 16589 |
| Copyright terms: Public domain | W3C validator |