Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iedgval0 | Structured version Visualization version GIF version |
Description: Degenerated case 1 for edges: The set of indexed edges of the empty set is the empty set. (Contributed by AV, 24-Sep-2020.) |
Ref | Expression |
---|---|
iedgval0 | ⊢ (iEdg‘∅) = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0nelxp 5570 | . . 3 ⊢ ¬ ∅ ∈ (V × V) | |
2 | 1 | iffalsei 4435 | . 2 ⊢ if(∅ ∈ (V × V), (2nd ‘∅), (.ef‘∅)) = (.ef‘∅) |
3 | iedgval 27046 | . 2 ⊢ (iEdg‘∅) = if(∅ ∈ (V × V), (2nd ‘∅), (.ef‘∅)) | |
4 | df-edgf 27034 | . . 3 ⊢ .ef = Slot ;18 | |
5 | 4 | str0 16717 | . 2 ⊢ ∅ = (.ef‘∅) |
6 | 2, 3, 5 | 3eqtr4i 2769 | 1 ⊢ (iEdg‘∅) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1543 ∈ wcel 2112 Vcvv 3398 ∅c0 4223 ifcif 4425 × cxp 5534 ‘cfv 6358 2nd c2nd 7738 1c1 10695 8c8 11856 ;cdc 12258 .efcedgf 27033 iEdgciedg 27042 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-sbc 3684 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-opab 5102 df-mpt 5121 df-id 5440 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-iota 6316 df-fun 6360 df-fv 6366 df-slot 16670 df-edgf 27034 df-iedg 27044 |
This theorem is referenced by: uhgr0 27118 usgr0 27285 0grsubgr 27320 0grrusgr 27621 |
Copyright terms: Public domain | W3C validator |