Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > 1wlkslem2 | Structured version Visualization version GIF version |
Description: Lemma 2 for 1-walks to substitute the index of the condition for vertices and edges in a 1-walk. (Contributed by AV, 23-Apr-2021.) |
Ref | Expression |
---|---|
1wlkslem2 | ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)}, {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴))) ↔ if-((𝑃‘𝐵) = (𝑃‘𝐶), (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}, {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6103 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑃‘𝐴) = (𝑃‘𝐵)) | |
2 | 1 | adantr 480 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘𝐴) = (𝑃‘𝐵)) |
3 | fveq2 6103 | . . . 4 ⊢ ((𝐴 + 1) = 𝐶 → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶)) | |
4 | 3 | adantl 481 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶)) |
5 | 2, 4 | eqeq12d 2625 | . 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)) ↔ (𝑃‘𝐵) = (𝑃‘𝐶))) |
6 | fveq2 6103 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝐹‘𝐴) = (𝐹‘𝐵)) | |
7 | 6 | fveq2d 6107 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵))) |
8 | 1 | sneqd 4137 | . . . 4 ⊢ (𝐴 = 𝐵 → {(𝑃‘𝐴)} = {(𝑃‘𝐵)}) |
9 | 7, 8 | eqeq12d 2625 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)})) |
10 | 9 | adantr 480 | . 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)})) |
11 | 2, 4 | preq12d 4220 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} = {(𝑃‘𝐵), (𝑃‘𝐶)}) |
12 | 7 | adantr 480 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵))) |
13 | 11, 12 | sseq12d 3597 | . 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ({(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴)) ↔ {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵)))) |
14 | 5, 10, 13 | ifpbi123d 1021 | 1 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)}, {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴))) ↔ if-((𝑃‘𝐵) = (𝑃‘𝐶), (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}, {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 if-wif 1006 = wceq 1475 ⊆ wss 3540 {csn 4125 {cpr 4127 ‘cfv 5804 (class class class)co 6549 1c1 9816 + caddc 9818 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-ifp 1007 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-iota 5768 df-fv 5812 |
This theorem is referenced by: 1wlkl1loop 40842 1wlk1walk 40843 crctcsh1wlkn0lem6 41018 11wlkdlem4 41307 |
Copyright terms: Public domain | W3C validator |