| 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 16387 | . . 3 ⊢ (𝜑 → dom (iEdg‘𝑋) = ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) |
| 14 | 2 | trlf1 16312 | . . . . . . 7 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 15 | 6, 14 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 16 | f1f 5551 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 17 | 15, 16 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
| 18 | 17 | fimassd 5506 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 19 | dfss2 3218 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) = (𝐹 “ (0..^𝑁))) | |
| 20 | 18, 19 | sylib 122 | . . 3 ⊢ (𝜑 → ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) = (𝐹 “ (0..^𝑁))) |
| 21 | 13, 20 | eqtrd 2264 | . 2 ⊢ (𝜑 → dom (iEdg‘𝑋) = (𝐹 “ (0..^𝑁))) |
| 22 | elfzoelz 10427 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ ℤ) | |
| 23 | 4, 22 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 24 | elfzoel2 10426 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ ℤ) | |
| 25 | 4, 24 | syl 14 | . . . . 5 ⊢ (𝜑 → (♯‘𝐹) ∈ ℤ) |
| 26 | elfzo0le 10470 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ≤ (♯‘𝐹)) | |
| 27 | 4, 26 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ≤ (♯‘𝐹)) |
| 28 | eluz2 9805 | . . . . 5 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ (♯‘𝐹) ∈ ℤ ∧ 𝑁 ≤ (♯‘𝐹))) | |
| 29 | 23, 25, 27, 28 | syl3anbrc 1208 | . . . 4 ⊢ (𝜑 → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) |
| 30 | fzoss2 10454 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 31 | 29, 30 | syl 14 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 32 | 0z 9534 | . . . 4 ⊢ 0 ∈ ℤ | |
| 33 | fzofig 10740 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin) | |
| 34 | 32, 23, 33 | sylancr 414 | . . 3 ⊢ (𝜑 → (0..^𝑁) ∈ Fin) |
| 35 | imaf1fi 7168 | . . 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 2308 | 1 ⊢ (𝜑 → dom (iEdg‘𝑋) ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2202 ∩ cin 3200 ⊆ wss 3201 {csn 3673 〈cop 3676 class class class wbr 4093 dom cdm 4731 ↾ cres 4733 “ cima 4734 Fun wfun 5327 ⟶wf 5329 –1-1→wf1 5330 ‘cfv 5333 (class class class)co 6028 Fincfn 6952 0cc0 8075 ≤ cle 8257 ℤcz 9523 ℤ≥cuz 9799 ...cfz 10288 ..^cfzo 10422 ♯chash 11083 Vtxcvtx 15936 iEdgciedg 15937 Trailsctrls 16304 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 |
| 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 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-1o 6625 df-er 6745 df-map 6862 df-en 6953 df-dom 6954 df-fin 6955 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-5 9247 df-6 9248 df-7 9249 df-8 9250 df-9 9251 df-n0 9445 df-z 9524 df-dec 9656 df-uz 9800 df-fz 10289 df-fzo 10423 df-ihash 11084 df-word 11163 df-ndx 13148 df-slot 13149 df-base 13151 df-edgf 15929 df-vtx 15938 df-iedg 15939 df-wlks 16242 df-trls 16305 |
| This theorem is referenced by: trlsegvdegfi 16391 eupth2lem3lem1fi 16392 |
| Copyright terms: Public domain | W3C validator |