| 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 16313 | . . 3 ⊢ (𝜑 → dom (iEdg‘𝑋) = ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) |
| 14 | 2 | trlf1 16238 | . . . . . . 7 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 15 | 6, 14 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 16 | f1f 5542 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 17 | 15, 16 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
| 18 | 17 | fimassd 5499 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 19 | dfss2 3217 | . . . 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 10381 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ ℤ) | |
| 23 | 4, 22 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 24 | elfzoel2 10380 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ ℤ) | |
| 25 | 4, 24 | syl 14 | . . . . 5 ⊢ (𝜑 → (♯‘𝐹) ∈ ℤ) |
| 26 | elfzo0le 10423 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ≤ (♯‘𝐹)) | |
| 27 | 4, 26 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑁 ≤ (♯‘𝐹)) |
| 28 | eluz2 9760 | . . . . 5 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ (♯‘𝐹) ∈ ℤ ∧ 𝑁 ≤ (♯‘𝐹))) | |
| 29 | 23, 25, 27, 28 | syl3anbrc 1207 | . . . 4 ⊢ (𝜑 → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) |
| 30 | fzoss2 10408 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 31 | 29, 30 | syl 14 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 32 | 0z 9489 | . . . 4 ⊢ 0 ∈ ℤ | |
| 33 | fzofig 10693 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin) | |
| 34 | 32, 23, 33 | sylancr 414 | . . 3 ⊢ (𝜑 → (0..^𝑁) ∈ Fin) |
| 35 | imaf1fi 7124 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹)) ∧ (0..^𝑁) ∈ Fin) → (𝐹 “ (0..^𝑁)) ∈ Fin) | |
| 36 | 15, 31, 34, 35 | syl3anc 1273 | . 2 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ∈ Fin) |
| 37 | 21, 36 | eqeltrd 2308 | 1 ⊢ (𝜑 → dom (iEdg‘𝑋) ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 ∩ cin 3199 ⊆ wss 3200 {csn 3669 〈cop 3672 class class class wbr 4088 dom cdm 4725 ↾ cres 4727 “ cima 4728 Fun wfun 5320 ⟶wf 5322 –1-1→wf1 5323 ‘cfv 5326 (class class class)co 6017 Fincfn 6908 0cc0 8031 ≤ cle 8214 ℤcz 9478 ℤ≥cuz 9754 ...cfz 10242 ..^cfzo 10376 ♯chash 11036 Vtxcvtx 15862 iEdgciedg 15863 Trailsctrls 16230 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-ifp 986 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-frec 6556 df-1o 6581 df-er 6701 df-map 6818 df-en 6909 df-dom 6910 df-fin 6911 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-inn 9143 df-2 9201 df-3 9202 df-4 9203 df-5 9204 df-6 9205 df-7 9206 df-8 9207 df-9 9208 df-n0 9402 df-z 9479 df-dec 9611 df-uz 9755 df-fz 10243 df-fzo 10377 df-ihash 11037 df-word 11113 df-ndx 13084 df-slot 13085 df-base 13087 df-edgf 15855 df-vtx 15864 df-iedg 15865 df-wlks 16168 df-trls 16231 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |