Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iedgval | Structured version Visualization version GIF version |
Description: The set of indexed edges of a graph. (Contributed by AV, 21-Sep-2020.) |
Ref | Expression |
---|---|
iedgval | ⊢ (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1 2900 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ (V × V) ↔ 𝐺 ∈ (V × V))) | |
2 | fveq2 6664 | . . . 4 ⊢ (𝑔 = 𝐺 → (2nd ‘𝑔) = (2nd ‘𝐺)) | |
3 | fveq2 6664 | . . . 4 ⊢ (𝑔 = 𝐺 → (.ef‘𝑔) = (.ef‘𝐺)) | |
4 | 1, 2, 3 | ifbieq12d 4493 | . . 3 ⊢ (𝑔 = 𝐺 → if(𝑔 ∈ (V × V), (2nd ‘𝑔), (.ef‘𝑔)) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))) |
5 | df-iedg 26778 | . . 3 ⊢ iEdg = (𝑔 ∈ V ↦ if(𝑔 ∈ (V × V), (2nd ‘𝑔), (.ef‘𝑔))) | |
6 | fvex 6677 | . . . 4 ⊢ (2nd ‘𝐺) ∈ V | |
7 | fvex 6677 | . . . 4 ⊢ (.ef‘𝐺) ∈ V | |
8 | 6, 7 | ifex 4514 | . . 3 ⊢ if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) ∈ V |
9 | 4, 5, 8 | fvmpt 6762 | . 2 ⊢ (𝐺 ∈ V → (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))) |
10 | fvprc 6657 | . . 3 ⊢ (¬ 𝐺 ∈ V → (.ef‘𝐺) = ∅) | |
11 | prcnel 3518 | . . . 4 ⊢ (¬ 𝐺 ∈ V → ¬ 𝐺 ∈ (V × V)) | |
12 | 11 | iffalsed 4477 | . . 3 ⊢ (¬ 𝐺 ∈ V → if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) = (.ef‘𝐺)) |
13 | fvprc 6657 | . . 3 ⊢ (¬ 𝐺 ∈ V → (iEdg‘𝐺) = ∅) | |
14 | 10, 12, 13 | 3eqtr4rd 2867 | . 2 ⊢ (¬ 𝐺 ∈ V → (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))) |
15 | 9, 14 | pm2.61i 184 | 1 ⊢ (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ∅c0 4290 ifcif 4466 × cxp 5547 ‘cfv 6349 2nd c2nd 7682 .efcedgf 26768 iEdgciedg 26776 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 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 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-iota 6308 df-fun 6351 df-fv 6357 df-iedg 26778 |
This theorem is referenced by: opiedgval 26785 funiedgdmge2val 26791 funiedgdm2val 26793 snstriedgval 26817 iedgval0 26819 |
Copyright terms: Public domain | W3C validator |