Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wlkp1lem4 | Structured version Visualization version GIF version |
Description: Lemma for wlkp1 28049. (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 2738 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
3 | 2 | wlkf 27981 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom (iEdg‘𝐺)) |
4 | eqid 2738 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
5 | 4 | wlkp 27983 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺)) |
6 | 3, 5 | jca 512 | . . 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 2842 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ (Vtx‘𝑆)) |
11 | 10 | elfvexd 6808 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
12 | 11 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑆 ∈ V) |
13 | wlkp1.h | . . . 4 ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) | |
14 | simprl 768 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝐹 ∈ Word dom (iEdg‘𝐺)) | |
15 | snex 5354 | . . . . 5 ⊢ {〈𝑁, 𝐵〉} ∈ V | |
16 | unexg 7599 | . . . . 5 ⊢ ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ {〈𝑁, 𝐵〉} ∈ V) → (𝐹 ∪ {〈𝑁, 𝐵〉}) ∈ V) | |
17 | 14, 15, 16 | sylancl 586 | . . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝐹 ∪ {〈𝑁, 𝐵〉}) ∈ V) |
18 | 13, 17 | eqeltrid 2843 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝐻 ∈ V) |
19 | wlkp1.q | . . . 4 ⊢ 𝑄 = (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) | |
20 | ovex 7308 | . . . . . . 7 ⊢ (0...(♯‘𝐹)) ∈ V | |
21 | fvex 6787 | . . . . . . 7 ⊢ (Vtx‘𝐺) ∈ V | |
22 | 20, 21 | fpm 8663 | . . . . . 6 ⊢ (𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) → 𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹)))) |
23 | 22 | ad2antll 726 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹)))) |
24 | snex 5354 | . . . . 5 ⊢ {〈(𝑁 + 1), 𝐶〉} ∈ V | |
25 | unexg 7599 | . . . . 5 ⊢ ((𝑃 ∈ ((Vtx‘𝐺) ↑pm (0...(♯‘𝐹))) ∧ {〈(𝑁 + 1), 𝐶〉} ∈ V) → (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) ∈ V) | |
26 | 23, 24, 25 | sylancl 586 | . . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) ∈ V) |
27 | 19, 26 | eqeltrid 2843 | . . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → 𝑄 ∈ V) |
28 | 12, 18, 27 | 3jca 1127 | . 2 ⊢ ((𝜑 ∧ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺))) → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V)) |
29 | 7, 28 | mpdan 684 | 1 ⊢ (𝜑 → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ∪ cun 3885 ⊆ wss 3887 {csn 4561 {cpr 4563 〈cop 4567 class class class wbr 5074 dom cdm 5589 Fun wfun 6427 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 ↑pm cpm 8616 Fincfn 8733 0cc0 10871 1c1 10872 + caddc 10874 ...cfz 13239 ♯chash 14044 Word cword 14217 Vtxcvtx 27366 iEdgciedg 27367 Edgcedg 27417 Walkscwlks 27963 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-ifp 1061 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-pm 8618 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-n0 12234 df-z 12320 df-uz 12583 df-fz 13240 df-fzo 13383 df-hash 14045 df-word 14218 df-wlks 27966 |
This theorem is referenced by: wlkp1 28049 |
Copyright terms: Public domain | W3C validator |