| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wlkp1lem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for wlkp1 30029. (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 2763 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 2 | wlkf 29964 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom (iEdg‘𝐺)) |
| 4 | eqid 2763 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 5 | 4 | wlkp 29966 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺)) |
| 6 | 3, 5 | jca 520 | . . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) |
| 7 | 1, 6 | syl 18 | . 2 ⊢ (𝜑 → (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) |
| 8 | wlkp1.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 9 | wlkp1.s | . . . . . 6 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) | |
| 10 | 8, 9 | eleqtrrd 2866 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ (Vtx‘𝑆)) |
| 11 | 10 | elfvexd 6917 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 12 | 11 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑆 ∈ V) |
| 13 | wlkp1.h | . . . 4 ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) | |
| 14 | simprl 782 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝐹 ∈ Word dom (iEdg‘𝐺)) | |
| 15 | snex 5410 | . . . . 5 ⊢ {〈𝑁, 𝐵〉} ∈ V | |
| 16 | unexg 7741 | . . . . 5 ⊢ ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ {〈𝑁, 𝐵〉} ∈ V) → (𝐹 ∪ {〈𝑁, 𝐵〉}) ∈ V) | |
| 17 | 14, 15, 16 | sylancl 597 | . . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝐹 ∪ {〈𝑁, 𝐵〉}) ∈ V) |
| 18 | 13, 17 | eqeltrid 2867 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝐻 ∈ V) |
| 19 | wlkp1.q | . . . 4 ⊢ 𝑄 = (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) | |
| 20 | ovex 7443 | . . . . . . 7 ⊢ (0...(♯‘𝐹)) ∈ V | |
| 21 | fvex 6894 | . . . . . . 7 ⊢ (Vtx‘𝐺) ∈ V | |
| 22 | 20, 21 | fpm 8869 | . . . . . 6 ⊢ (𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) → 𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹)))) |
| 23 | 22 | ad2antll 741 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹)))) |
| 24 | snex 5410 | . . . . 5 ⊢ {〈(𝑁 + 1), 𝐶〉} ∈ V | |
| 25 | unexg 7741 | . . . . 5 ⊢ ((𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹))) ∧ {〈(𝑁 + 1), 𝐶〉} ∈ V) → (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) ∈ V) | |
| 26 | 23, 24, 25 | sylancl 597 | . . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) ∈ V) |
| 27 | 19, 26 | eqeltrid 2867 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑄 ∈ V) |
| 28 | 12, 18, 27 | 3jca 1146 | . 2 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V)) |
| 29 | 7, 28 | mpdan 699 | 1 ⊢ (𝜑 → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∪ cun 3903 ⊆ wss 3905 {csn 4589 {cpr 4591 〈cop 4595 class class class wbr 5109 dom cdm 5661 Fun wfun 6530 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ↑pm cpm 8821 Fincfn 8939 0cc0 11095 1c1 11096 + caddc 11098 ...cfz 13530 ♯chash 14362 Word cword 14546 Vtxcvtx 29346 iEdgciedg 29347 Edgcedg 29397 Walkscwlks 29946 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-fz 13531 df-fzo 13679 df-hash 14363 df-word 14547 df-wlks 29949 |
| This theorem is referenced by: wlkp1 30029 |
| Copyright terms: Public domain | W3C validator |