![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 2wlklem | Structured version Visualization version GIF version |
Description: Lemma for theorems for walks of length 2. (Contributed by Alexander van der Vekens, 1-Feb-2018.) |
Ref | Expression |
---|---|
2wlklem | ⊢ (∀𝑘 ∈ {0, 1} (𝐸‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ↔ ((𝐸‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐸‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | c0ex 11156 | . 2 ⊢ 0 ∈ V | |
2 | 1ex 11158 | . 2 ⊢ 1 ∈ V | |
3 | 2fveq3 6852 | . . 3 ⊢ (𝑘 = 0 → (𝐸‘(𝐹‘𝑘)) = (𝐸‘(𝐹‘0))) | |
4 | fveq2 6847 | . . . 4 ⊢ (𝑘 = 0 → (𝑃‘𝑘) = (𝑃‘0)) | |
5 | fv0p1e1 12283 | . . . 4 ⊢ (𝑘 = 0 → (𝑃‘(𝑘 + 1)) = (𝑃‘1)) | |
6 | 4, 5 | preq12d 4707 | . . 3 ⊢ (𝑘 = 0 → {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} = {(𝑃‘0), (𝑃‘1)}) |
7 | 3, 6 | eqeq12d 2753 | . 2 ⊢ (𝑘 = 0 → ((𝐸‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ↔ (𝐸‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)})) |
8 | 2fveq3 6852 | . . 3 ⊢ (𝑘 = 1 → (𝐸‘(𝐹‘𝑘)) = (𝐸‘(𝐹‘1))) | |
9 | fveq2 6847 | . . . 4 ⊢ (𝑘 = 1 → (𝑃‘𝑘) = (𝑃‘1)) | |
10 | oveq1 7369 | . . . . . 6 ⊢ (𝑘 = 1 → (𝑘 + 1) = (1 + 1)) | |
11 | 1p1e2 12285 | . . . . . 6 ⊢ (1 + 1) = 2 | |
12 | 10, 11 | eqtrdi 2793 | . . . . 5 ⊢ (𝑘 = 1 → (𝑘 + 1) = 2) |
13 | 12 | fveq2d 6851 | . . . 4 ⊢ (𝑘 = 1 → (𝑃‘(𝑘 + 1)) = (𝑃‘2)) |
14 | 9, 13 | preq12d 4707 | . . 3 ⊢ (𝑘 = 1 → {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} = {(𝑃‘1), (𝑃‘2)}) |
15 | 8, 14 | eqeq12d 2753 | . 2 ⊢ (𝑘 = 1 → ((𝐸‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ↔ (𝐸‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) |
16 | 1, 2, 7, 15 | ralpr 4666 | 1 ⊢ (∀𝑘 ∈ {0, 1} (𝐸‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ↔ ((𝐸‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐸‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 397 = wceq 1542 ∀wral 3065 {cpr 4593 ‘cfv 6501 (class class class)co 7362 0cc0 11058 1c1 11059 + caddc 11061 2c2 12215 |
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 2708 ax-sep 5261 ax-nul 5268 ax-pow 5325 ax-pr 5389 ax-un 7677 ax-resscn 11115 ax-1cn 11116 ax-icn 11117 ax-addcl 11118 ax-addrcl 11119 ax-mulcl 11120 ax-mulrcl 11121 ax-mulcom 11122 ax-addass 11123 ax-mulass 11124 ax-distr 11125 ax-i2m1 11126 ax-1ne0 11127 ax-1rid 11128 ax-rnegex 11129 ax-rrecex 11130 ax-cnre 11131 ax-pre-lttri 11132 ax-pre-lttrn 11133 ax-pre-ltadd 11134 |
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 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3066 df-rex 3075 df-rab 3411 df-v 3450 df-sbc 3745 df-csb 3861 df-dif 3918 df-un 3920 df-in 3922 df-ss 3932 df-nul 4288 df-if 4492 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-opab 5173 df-mpt 5194 df-id 5536 df-po 5550 df-so 5551 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6453 df-fun 6503 df-fn 6504 df-f 6505 df-f1 6506 df-fo 6507 df-f1o 6508 df-fv 6509 df-ov 7365 df-er 8655 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11198 df-mnf 11199 df-ltxr 11201 df-2 12223 |
This theorem is referenced by: upgr2wlk 28658 usgr2wlkneq 28746 usgr2trlncl 28750 usgr2pthlem 28753 usgr2pth 28754 uspgrn2crct 28795 wlk2v2elem2 29142 |
Copyright terms: Public domain | W3C validator |