![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wlk2v2elem2 | Structured version Visualization version GIF version |
Description: Lemma 2 for wlk2v2e 29400: The values of 𝐼 after 𝐹 are edges between two vertices enumerated by 𝑃. (Contributed by Alexander van der Vekens, 22-Oct-2017.) (Revised by AV, 9-Jan-2021.) |
Ref | Expression |
---|---|
wlk2v2e.i | ⊢ 𝐼 = ⟨“{𝑋, 𝑌}”⟩ |
wlk2v2e.f | ⊢ 𝐹 = ⟨“00”⟩ |
wlk2v2e.x | ⊢ 𝑋 ∈ V |
wlk2v2e.y | ⊢ 𝑌 ∈ V |
wlk2v2e.p | ⊢ 𝑃 = ⟨“𝑋𝑌𝑋”⟩ |
Ref | Expression |
---|---|
wlk2v2elem2 | ⊢ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wlk2v2e.f | . . . . . . 7 ⊢ 𝐹 = ⟨“00”⟩ | |
2 | 1 | fveq1i 6890 | . . . . . 6 ⊢ (𝐹‘0) = (⟨“00”⟩‘0) |
3 | 0z 12566 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
4 | s2fv0 14835 | . . . . . . 7 ⊢ (0 ∈ ℤ → (⟨“00”⟩‘0) = 0) | |
5 | 3, 4 | ax-mp 5 | . . . . . 6 ⊢ (⟨“00”⟩‘0) = 0 |
6 | 2, 5 | eqtri 2761 | . . . . 5 ⊢ (𝐹‘0) = 0 |
7 | 6 | fveq2i 6892 | . . . 4 ⊢ (𝐼‘(𝐹‘0)) = (𝐼‘0) |
8 | wlk2v2e.i | . . . . . 6 ⊢ 𝐼 = ⟨“{𝑋, 𝑌}”⟩ | |
9 | 8 | fveq1i 6890 | . . . . 5 ⊢ (𝐼‘0) = (⟨“{𝑋, 𝑌}”⟩‘0) |
10 | prex 5432 | . . . . . 6 ⊢ {𝑋, 𝑌} ∈ V | |
11 | s1fv 14557 | . . . . . 6 ⊢ ({𝑋, 𝑌} ∈ V → (⟨“{𝑋, 𝑌}”⟩‘0) = {𝑋, 𝑌}) | |
12 | 10, 11 | ax-mp 5 | . . . . 5 ⊢ (⟨“{𝑋, 𝑌}”⟩‘0) = {𝑋, 𝑌} |
13 | 9, 12 | eqtri 2761 | . . . 4 ⊢ (𝐼‘0) = {𝑋, 𝑌} |
14 | wlk2v2e.p | . . . . . . . 8 ⊢ 𝑃 = ⟨“𝑋𝑌𝑋”⟩ | |
15 | 14 | fveq1i 6890 | . . . . . . 7 ⊢ (𝑃‘0) = (⟨“𝑋𝑌𝑋”⟩‘0) |
16 | wlk2v2e.x | . . . . . . . 8 ⊢ 𝑋 ∈ V | |
17 | s3fv0 14839 | . . . . . . . 8 ⊢ (𝑋 ∈ V → (⟨“𝑋𝑌𝑋”⟩‘0) = 𝑋) | |
18 | 16, 17 | ax-mp 5 | . . . . . . 7 ⊢ (⟨“𝑋𝑌𝑋”⟩‘0) = 𝑋 |
19 | 15, 18 | eqtri 2761 | . . . . . 6 ⊢ (𝑃‘0) = 𝑋 |
20 | 14 | fveq1i 6890 | . . . . . . 7 ⊢ (𝑃‘1) = (⟨“𝑋𝑌𝑋”⟩‘1) |
21 | wlk2v2e.y | . . . . . . . 8 ⊢ 𝑌 ∈ V | |
22 | s3fv1 14840 | . . . . . . . 8 ⊢ (𝑌 ∈ V → (⟨“𝑋𝑌𝑋”⟩‘1) = 𝑌) | |
23 | 21, 22 | ax-mp 5 | . . . . . . 7 ⊢ (⟨“𝑋𝑌𝑋”⟩‘1) = 𝑌 |
24 | 20, 23 | eqtri 2761 | . . . . . 6 ⊢ (𝑃‘1) = 𝑌 |
25 | 19, 24 | preq12i 4742 | . . . . 5 ⊢ {(𝑃‘0), (𝑃‘1)} = {𝑋, 𝑌} |
26 | 25 | eqcomi 2742 | . . . 4 ⊢ {𝑋, 𝑌} = {(𝑃‘0), (𝑃‘1)} |
27 | 7, 13, 26 | 3eqtri 2765 | . . 3 ⊢ (𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} |
28 | 1 | fveq1i 6890 | . . . . . 6 ⊢ (𝐹‘1) = (⟨“00”⟩‘1) |
29 | s2fv1 14836 | . . . . . . 7 ⊢ (0 ∈ ℤ → (⟨“00”⟩‘1) = 0) | |
30 | 3, 29 | ax-mp 5 | . . . . . 6 ⊢ (⟨“00”⟩‘1) = 0 |
31 | 28, 30 | eqtri 2761 | . . . . 5 ⊢ (𝐹‘1) = 0 |
32 | 31 | fveq2i 6892 | . . . 4 ⊢ (𝐼‘(𝐹‘1)) = (𝐼‘0) |
33 | prcom 4736 | . . . . 5 ⊢ {𝑋, 𝑌} = {𝑌, 𝑋} | |
34 | 14 | fveq1i 6890 | . . . . . . . 8 ⊢ (𝑃‘2) = (⟨“𝑋𝑌𝑋”⟩‘2) |
35 | s3fv2 14841 | . . . . . . . . 9 ⊢ (𝑋 ∈ V → (⟨“𝑋𝑌𝑋”⟩‘2) = 𝑋) | |
36 | 16, 35 | ax-mp 5 | . . . . . . . 8 ⊢ (⟨“𝑋𝑌𝑋”⟩‘2) = 𝑋 |
37 | 34, 36 | eqtri 2761 | . . . . . . 7 ⊢ (𝑃‘2) = 𝑋 |
38 | 24, 37 | preq12i 4742 | . . . . . 6 ⊢ {(𝑃‘1), (𝑃‘2)} = {𝑌, 𝑋} |
39 | 38 | eqcomi 2742 | . . . . 5 ⊢ {𝑌, 𝑋} = {(𝑃‘1), (𝑃‘2)} |
40 | 33, 39 | eqtri 2761 | . . . 4 ⊢ {𝑋, 𝑌} = {(𝑃‘1), (𝑃‘2)} |
41 | 32, 13, 40 | 3eqtri 2765 | . . 3 ⊢ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)} |
42 | 2wlklem 28914 | . . 3 ⊢ (∀𝑘 ∈ {0, 1} (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ↔ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) | |
43 | 27, 41, 42 | mpbir2an 710 | . 2 ⊢ ∀𝑘 ∈ {0, 1} (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} |
44 | 14, 1 | 2wlkdlem2 29170 | . . 3 ⊢ (0..^(♯‘𝐹)) = {0, 1} |
45 | 44 | raleqi 3324 | . 2 ⊢ (∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ↔ ∀𝑘 ∈ {0, 1} (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}) |
46 | 43, 45 | mpbir 230 | 1 ⊢ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 {cpr 4630 ‘cfv 6541 (class class class)co 7406 0cc0 11107 1c1 11108 + caddc 11110 2c2 12264 ℤcz 12555 ..^cfzo 13624 ♯chash 14287 ⟨“cs1 14542 ⟨“cs2 14789 ⟨“cs3 14790 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-card 9931 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-n0 12470 df-z 12556 df-uz 12820 df-fz 13482 df-fzo 13625 df-hash 14288 df-word 14462 df-concat 14518 df-s1 14543 df-s2 14796 df-s3 14797 |
This theorem is referenced by: wlk2v2e 29400 |
Copyright terms: Public domain | W3C validator |