Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > opiedgfvi | Structured version Visualization version GIF version |
Description: The set of indexed edges of a graph represented as an ordered pair of vertices and indexed edges as function value. (Contributed by AV, 4-Mar-2021.) |
Ref | Expression |
---|---|
opvtxfvi.v | ⊢ 𝑉 ∈ V |
opvtxfvi.e | ⊢ 𝐸 ∈ V |
Ref | Expression |
---|---|
opiedgfvi | ⊢ (iEdg‘〈𝑉, 𝐸〉) = 𝐸 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opvtxfvi.v | . 2 ⊢ 𝑉 ∈ V | |
2 | opvtxfvi.e | . 2 ⊢ 𝐸 ∈ V | |
3 | opiedgfv 26792 | . 2 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) | |
4 | 1, 2, 3 | mp2an 690 | 1 ⊢ (iEdg‘〈𝑉, 𝐸〉) = 𝐸 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 Vcvv 3494 〈cop 4573 ‘cfv 6355 iEdgciedg 26782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-iota 6314 df-fun 6357 df-fv 6363 df-2nd 7690 df-iedg 26784 |
This theorem is referenced by: graop 26814 iedgvalsnop 26827 griedg0ssusgr 27047 uhgrspanop 27078 vtxdgop 27252 vtxdginducedm1lem1 27321 finsumvtxdg2size 27332 rgrusgrprc 27371 eupth2lem3 28015 konigsberglem1 28031 konigsberglem2 28032 konigsberglem3 28033 |
Copyright terms: Public domain | W3C validator |