| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eupth2lem3lem2fi | GIF version | ||
| Description: Lemma for eupth2lem3fi 16458. (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...𝑁)))) |
| trlsegvdegfi.g | ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
| trlsegvdegfi.v | ⊢ (𝜑 → 𝑉 ∈ Fin) |
| Ref | Expression |
|---|---|
| eupth2lem3lem2fi | ⊢ (𝜑 → ((VtxDeg‘𝑌)‘𝑈) ∈ ℕ0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2232 | . . 3 ⊢ (Vtx‘𝑌) = (Vtx‘𝑌) | |
| 2 | eqid 2232 | . . 3 ⊢ (iEdg‘𝑌) = (iEdg‘𝑌) | |
| 3 | eqid 2232 | . . 3 ⊢ dom (iEdg‘𝑌) = dom (iEdg‘𝑌) | |
| 4 | trlsegvdeg.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 5 | trlsegvdeg.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 6 | trlsegvdeg.f | . . . 4 ⊢ (𝜑 → Fun 𝐼) | |
| 7 | trlsegvdeg.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 8 | trlsegvdeg.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
| 9 | trlsegvdeg.w | . . . 4 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) | |
| 10 | trlsegvdeg.vx | . . . 4 ⊢ (𝜑 → (Vtx‘𝑋) = 𝑉) | |
| 11 | trlsegvdeg.vy | . . . 4 ⊢ (𝜑 → (Vtx‘𝑌) = 𝑉) | |
| 12 | trlsegvdeg.vz | . . . 4 ⊢ (𝜑 → (Vtx‘𝑍) = 𝑉) | |
| 13 | trlsegvdeg.ix | . . . 4 ⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))) | |
| 14 | trlsegvdeg.iy | . . . 4 ⊢ (𝜑 → (iEdg‘𝑌) = {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉}) | |
| 15 | trlsegvdeg.iz | . . . 4 ⊢ (𝜑 → (iEdg‘𝑍) = (𝐼 ↾ (𝐹 “ (0...𝑁)))) | |
| 16 | 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 | trlsegvdeglem7 16448 | . . 3 ⊢ (𝜑 → dom (iEdg‘𝑌) ∈ Fin) |
| 17 | trlsegvdegfi.v | . . . 4 ⊢ (𝜑 → 𝑉 ∈ Fin) | |
| 18 | 11, 17 | eqeltrd 2309 | . . 3 ⊢ (𝜑 → (Vtx‘𝑌) ∈ Fin) |
| 19 | 8, 11 | eleqtrrd 2312 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ (Vtx‘𝑌)) |
| 20 | df-vtx 15996 | . . . . . 6 ⊢ Vtx = (𝑔 ∈ V ↦ if(𝑔 ∈ (V × V), (1st ‘𝑔), (Base‘𝑔))) | |
| 21 | 20 | mptrcl 5759 | . . . . 5 ⊢ (𝑈 ∈ (Vtx‘𝑌) → 𝑌 ∈ V) |
| 22 | 19, 21 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ V) |
| 23 | 6 | funfnd 5382 | . . . . . 6 ⊢ (𝜑 → 𝐼 Fn dom 𝐼) |
| 24 | 5 | trlf1 16370 | . . . . . . . 8 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 25 | f1f 5572 | . . . . . . . 8 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 26 | 9, 24, 25 | 3syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
| 27 | 26, 7 | ffvelcdmd 5812 | . . . . . 6 ⊢ (𝜑 → (𝐹‘𝑁) ∈ dom 𝐼) |
| 28 | fnressn 5869 | . . . . . 6 ⊢ ((𝐼 Fn dom 𝐼 ∧ (𝐹‘𝑁) ∈ dom 𝐼) → (𝐼 ↾ {(𝐹‘𝑁)}) = {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉}) | |
| 29 | 23, 27, 28 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝐼 ↾ {(𝐹‘𝑁)}) = {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉}) |
| 30 | 14, 29 | eqtr4d 2268 | . . . 4 ⊢ (𝜑 → (iEdg‘𝑌) = (𝐼 ↾ {(𝐹‘𝑁)})) |
| 31 | trlsegvdegfi.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ UPGraph) | |
| 32 | 4, 5, 22, 11, 30, 31 | upgrspan 16261 | . . 3 ⊢ (𝜑 → 𝑌 ∈ UPGraph) |
| 33 | 1, 2, 3, 16, 18, 32 | vtxdgfif 16275 | . 2 ⊢ (𝜑 → (VtxDeg‘𝑌):(Vtx‘𝑌)⟶ℕ0) |
| 34 | 33, 19 | ffvelcdmd 5812 | 1 ⊢ (𝜑 → ((VtxDeg‘𝑌)‘𝑈) ∈ ℕ0) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 Vcvv 2812 ifcif 3619 {csn 3688 〈cop 3691 class class class wbr 4108 × cxp 4746 dom cdm 4748 ↾ cres 4750 “ cima 4751 Fun wfun 5345 Fn wfn 5346 ⟶wf 5347 –1-1→wf1 5348 ‘cfv 5351 (class class class)co 6049 1st c1st 6331 Fincfn 6974 0cc0 8123 ℕ0cn0 9492 ...cfz 10338 ..^cfzo 10472 ♯chash 11133 Basecbs 13201 Vtxcvtx 15994 iEdgciedg 15995 UPGraphcupgr 16073 VtxDegcvtxdg 16268 Trailsctrls 16362 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-apti 8238 ax-pre-ltadd 8239 |
| 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 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-1o 6646 df-2o 6647 df-er 6766 df-map 6883 df-en 6975 df-dom 6976 df-fin 6977 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-inn 9234 df-2 9292 df-3 9293 df-4 9294 df-5 9295 df-6 9296 df-7 9297 df-8 9298 df-9 9299 df-n0 9493 df-z 9574 df-dec 9706 df-uz 9850 df-xadd 10102 df-fz 10339 df-fzo 10473 df-ihash 11134 df-word 11218 df-ndx 13204 df-slot 13205 df-base 13207 df-edgf 15987 df-vtx 15996 df-iedg 15997 df-edg 16040 df-uhgrm 16051 df-upgren 16075 df-subgr 16236 df-vtxdg 16269 df-wlks 16300 df-trls 16363 |
| This theorem is referenced by: eupth2lem3lem3fi 16452 |
| Copyright terms: Public domain | W3C validator |