| 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 16618 | . . 3 ⊢ (𝜑 → dom (iEdg‘𝑋) = ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) |
| 14 | 2 | trlf1 16543 | . . . . . . 7 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 15 | 6, 14 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 16 | f1f 5593 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 17 | 15, 16 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
| 18 | 17 | fimassd 5546 | . . . 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 10532 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ ℤ) | |
| 23 | 4, 22 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 24 | elfzoel2 10531 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ ℤ) | |
| 25 | 4, 24 | syl 14 | . . . . 5 ⊢ (𝜑 → (♯‘𝐹) ∈ ℤ) |
| 26 | elfzo0le 10575 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ≤ (♯‘𝐹)) | |
| 27 | 4, 26 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ≤ (♯‘𝐹)) |
| 28 | eluz2 9906 | . . . . 5 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ (♯‘𝐹) ∈ ℤ ∧ 𝑁 ≤ (♯‘𝐹))) | |
| 29 | 23, 25, 27, 28 | syl3anbrc 1212 | . . . 4 ⊢ (𝜑 → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) |
| 30 | fzoss2 10559 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 31 | 29, 30 | syl 14 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 32 | 0z 9634 | . . . 4 ⊢ 0 ∈ ℤ | |
| 33 | fzofig 10847 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin) | |
| 34 | 32, 23, 33 | sylancr 418 | . . 3 ⊢ (𝜑 → (0..^𝑁) ∈ Fin) |
| 35 | imaf1fi 7230 | . . 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 |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 ∩ cin 3219 ⊆ wss 3220 {csn 3705 〈cop 3708 class class class wbr 4125 dom cdm 4769 ↾ cres 4771 “ cima 4772 Fun wfun 5366 ⟶wf 5368 –1-1→wf1 5369 ‘cfv 5372 (class class class)co 6075 Fincfn 7012 0cc0 8169 ≤ cle 8351 ℤcz 9623 ℤ≥cuz 9900 ...cfz 10390 ..^cfzo 10527 ♯chash 11192 Vtxcvtx 16167 iEdgciedg 16168 Trailsctrls 16535 |
| 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 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 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 |
| This theorem 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 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-1o 6677 df-er 6797 df-map 6914 df-en 7013 df-dom 7014 df-fin 7015 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-inn 9284 df-2 9342 df-3 9343 df-4 9344 df-5 9345 df-6 9346 df-7 9347 df-8 9348 df-9 9349 df-n0 9543 df-z 9624 df-dec 9757 df-uz 9901 df-fz 10391 df-fzo 10528 df-ihash 11193 df-word 11283 df-ndx 13333 df-slot 13334 df-base 13336 df-edgf 16160 df-vtx 16169 df-iedg 16170 df-wlks 16473 df-trls 16536 |
| This theorem is referenced by: trlsegvdegfi 16622 eupth2lem3lem1fi 16623 |
| Copyright terms: Public domain | W3C validator |