| 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 16704 | . . 3 ⊢ (𝜑 → dom (iEdg‘𝑋) = ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) |
| 14 | 2 | trlf1 16629 | . . . . . . 7 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 15 | 6, 14 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 16 | f1f 5598 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 17 | 15, 16 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
| 18 | 17 | fimassd 5551 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 19 | dfss2 3237 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) = (𝐹 “ (0..^𝑁))) | |
| 20 | 18, 19 | sylib 122 | . . 3 ⊢ (𝜑 → ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) = (𝐹 “ (0..^𝑁))) |
| 21 | 13, 20 | eqtrd 2271 | . 2 ⊢ (𝜑 → dom (iEdg‘𝑋) = (𝐹 “ (0..^𝑁))) |
| 22 | elfzoelz 10554 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ ℤ) | |
| 23 | 4, 22 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 24 | elfzoel2 10553 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ ℤ) | |
| 25 | 4, 24 | syl 14 | . . . . 5 ⊢ (𝜑 → (♯‘𝐹) ∈ ℤ) |
| 26 | elfzo0le 10597 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ≤ (♯‘𝐹)) | |
| 27 | 4, 26 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ≤ (♯‘𝐹)) |
| 28 | eluz2 9927 | . . . . 5 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ (♯‘𝐹) ∈ ℤ ∧ 𝑁 ≤ (♯‘𝐹))) | |
| 29 | 23, 25, 27, 28 | syl3anbrc 1212 | . . . 4 ⊢ (𝜑 → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) |
| 30 | fzoss2 10581 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 31 | 29, 30 | syl 14 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 32 | 0z 9655 | . . . 4 ⊢ 0 ∈ ℤ | |
| 33 | fzofig 10869 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin) | |
| 34 | 32, 23, 33 | sylancr 418 | . . 3 ⊢ (𝜑 → (0..^𝑁) ∈ Fin) |
| 35 | imaf1fi 7240 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹)) ∧ (0..^𝑁) ∈ Fin) → (𝐹 “ (0..^𝑁)) ∈ Fin) | |
| 36 | 15, 31, 34, 35 | syl3anc 1278 | . 2 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ∈ Fin) |
| 37 | 21, 36 | eqeltrd 2315 | 1 ⊢ (𝜑 → dom (iEdg‘𝑋) ∈ Fin) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ∩ cin 3219 ⊆ wss 3220 {csn 3709 〈cop 3712 class class class wbr 4130 dom cdm 4774 ↾ cres 4776 “ cima 4777 Fun wfun 5371 ⟶wf 5373 –1-1→wf1 5374 ‘cfv 5377 (class class class)co 6085 Fincfn 7022 0cc0 8179 ≤ cle 8361 ℤcz 9644 ℤ≥cuz 9921 ...cfz 10411 ..^cfzo 10549 ♯chash 11214 Vtxcvtx 16253 iEdgciedg 16254 Trailsctrls 16621 |
| 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-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-ifp 991 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-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-er 6807 df-map 6924 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-5 9366 df-6 9367 df-7 9368 df-8 9369 df-9 9370 df-n0 9564 df-z 9645 df-dec 9778 df-uz 9922 df-fz 10412 df-fzo 10550 df-ihash 11215 df-word 11305 df-ndx 13355 df-slot 13356 df-base 13358 df-edgf 16246 df-vtx 16255 df-iedg 16256 df-wlks 16559 df-trls 16622 |
| This theorem is used by: trlsegvdegfi 16708 eupth2lem3lem1fi 16709 |
| Copyright terms: Public domain | W3C validator |