Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iedgedg | Structured version Visualization version GIF version |
Description: An indexed edge is an edge. (Contributed by AV, 19-Dec-2021.) |
Ref | Expression |
---|---|
iedgedg.e | ⊢ 𝐸 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
iedgedg | ⊢ ((Fun 𝐸 ∧ 𝐼 ∈ dom 𝐸) → (𝐸‘𝐼) ∈ (Edg‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvelrn 6875 | . 2 ⊢ ((Fun 𝐸 ∧ 𝐼 ∈ dom 𝐸) → (𝐸‘𝐼) ∈ ran 𝐸) | |
2 | edgval 27094 | . . 3 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
3 | iedgedg.e | . . . 4 ⊢ 𝐸 = (iEdg‘𝐺) | |
4 | 3 | rneqi 5791 | . . 3 ⊢ ran 𝐸 = ran (iEdg‘𝐺) |
5 | 2, 4 | eqtr4i 2762 | . 2 ⊢ (Edg‘𝐺) = ran 𝐸 |
6 | 1, 5 | eleqtrrdi 2842 | 1 ⊢ ((Fun 𝐸 ∧ 𝐼 ∈ dom 𝐸) → (𝐸‘𝐼) ∈ (Edg‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2112 dom cdm 5536 ran crn 5537 Fun wfun 6352 ‘cfv 6358 iEdgciedg 27042 Edgcedg 27092 |
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 ax-un 7501 |
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-rn 5547 df-iota 6316 df-fun 6360 df-fn 6361 df-fv 6366 df-edg 27093 |
This theorem is referenced by: edglnl 27188 numedglnl 27189 umgr2cycllem 32769 |
Copyright terms: Public domain | W3C validator |