![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > 1wlkop | Structured version Visualization version GIF version |
Description: A walk is an ordered pair. (Contributed by Alexander van der Vekens, 30-Jun-2018.) (Revised by AV, 1-Jan-2021.) |
Ref | Expression |
---|---|
1wlkop | ⊢ (𝑊 ∈ (1Walks‘𝐺) → 𝑊 = 〈(1st ‘𝑊), (2nd ‘𝑊)〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rel1wlk 40830 | . 2 ⊢ Rel (1Walks‘𝐺) | |
2 | 1st2nd 7105 | . 2 ⊢ ((Rel (1Walks‘𝐺) ∧ 𝑊 ∈ (1Walks‘𝐺)) → 𝑊 = 〈(1st ‘𝑊), (2nd ‘𝑊)〉) | |
3 | 1, 2 | mpan 702 | 1 ⊢ (𝑊 ∈ (1Walks‘𝐺) → 𝑊 = 〈(1st ‘𝑊), (2nd ‘𝑊)〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 〈cop 4131 Rel wrel 5043 ‘cfv 5804 1st c1st 7057 2nd c2nd 7058 1Walksc1wlks 40796 |
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-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 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-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fv 5812 df-1st 7059 df-2nd 7060 df-1wlks 40800 |
This theorem is referenced by: 1wlkcpr 40833 1wlkeq 40838 |
Copyright terms: Public domain | W3C validator |