| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wlkp1lem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for wlkp1 29877. (Contributed by AV, 6-Mar-2021.) |
| Ref | Expression |
|---|---|
| wlkp1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| wlkp1.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| wlkp1.f | ⊢ (𝜑 → Fun 𝐼) |
| wlkp1.a | ⊢ (𝜑 → 𝐼 ∈ Fin) |
| wlkp1.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| wlkp1.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| wlkp1.d | ⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐼) |
| wlkp1.w | ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
| wlkp1.n | ⊢ 𝑁 = (♯‘𝐹) |
| wlkp1.e | ⊢ (𝜑 → 𝐸 ∈ (Edg‘𝐺)) |
| wlkp1.x | ⊢ (𝜑 → {(𝑃‘𝑁), 𝐶} ⊆ 𝐸) |
| wlkp1.u | ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ∪ {〈𝐵, 𝐸〉})) |
| wlkp1.h | ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) |
| wlkp1.q | ⊢ 𝑄 = (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) |
| wlkp1.s | ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) |
| Ref | Expression |
|---|---|
| wlkp1lem4 | ⊢ (𝜑 → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wlkp1.w | . . 3 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) | |
| 2 | eqid 2762 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 2 | wlkf 29812 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom (iEdg‘𝐺)) |
| 4 | eqid 2762 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 5 | 4 | wlkp 29814 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺)) |
| 6 | 3, 5 | jca 519 | . . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) |
| 7 | 1, 6 | syl 17 | . 2 ⊢ (𝜑 → (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) |
| 8 | wlkp1.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 9 | wlkp1.s | . . . . . 6 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) | |
| 10 | 8, 9 | eleqtrrd 2865 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ (Vtx‘𝑆)) |
| 11 | 10 | elfvexd 6903 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 12 | 11 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑆 ∈ V) |
| 13 | wlkp1.h | . . . 4 ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) | |
| 14 | simprl 780 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝐹 ∈ Word dom (iEdg‘𝐺)) | |
| 15 | snex 5396 | . . . . 5 ⊢ {〈𝑁, 𝐵〉} ∈ V | |
| 16 | unexg 7726 | . . . . 5 ⊢ ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ {〈𝑁, 𝐵〉} ∈ V) → (𝐹 ∪ {〈𝑁, 𝐵〉}) ∈ V) | |
| 17 | 14, 15, 16 | sylancl 595 | . . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝐹 ∪ {〈𝑁, 𝐵〉}) ∈ V) |
| 18 | 13, 17 | eqeltrid 2866 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝐻 ∈ V) |
| 19 | wlkp1.q | . . . 4 ⊢ 𝑄 = (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) | |
| 20 | ovex 7429 | . . . . . . 7 ⊢ (0...(♯‘𝐹)) ∈ V | |
| 21 | fvex 6880 | . . . . . . 7 ⊢ (Vtx‘𝐺) ∈ V | |
| 22 | 20, 21 | fpm 8857 | . . . . . 6 ⊢ (𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) → 𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹)))) |
| 23 | 22 | ad2antll 739 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹)))) |
| 24 | snex 5396 | . . . . 5 ⊢ {〈(𝑁 + 1), 𝐶〉} ∈ V | |
| 25 | unexg 7726 | . . . . 5 ⊢ ((𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹))) ∧ {〈(𝑁 + 1), 𝐶〉} ∈ V) → (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) ∈ V) | |
| 26 | 23, 24, 25 | sylancl 595 | . . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) ∈ V) |
| 27 | 19, 26 | eqeltrid 2866 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑄 ∈ V) |
| 28 | 12, 18, 27 | 3jca 1141 | . 2 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V)) |
| 29 | 7, 28 | mpdan 697 | 1 ⊢ (𝜑 → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∪ cun 3902 ⊆ wss 3904 {csn 4582 {cpr 4584 〈cop 4588 class class class wbr 5100 dom cdm 5647 Fun wfun 6515 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 ↑pm cpm 8809 Fincfn 8927 0cc0 11073 1c1 11074 + caddc 11076 ...cfz 13512 ♯chash 14343 Word cword 14526 Vtxcvtx 29194 iEdgciedg 29195 Edgcedg 29245 Walkscwlks 29794 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ifp 1075 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-map 8810 df-pm 8811 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-card 9897 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-n0 12482 df-z 12569 df-uz 12840 df-fz 13513 df-fzo 13660 df-hash 14344 df-word 14527 df-wlks 29797 |
| This theorem is referenced by: wlkp1 29877 |
| Copyright terms: Public domain | W3C validator |