Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iedgval3sn | Structured version Visualization version GIF version |
Description: Degenerated case 3 for edges: The set of indexed edges of a singleton containing a singleton containing a singleton is the innermost singleton. (Contributed by AV, 24-Sep-2020.) (Avoid depending on this detail.) |
Ref | Expression |
---|---|
vtxval3sn.a | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
iedgval3sn | ⊢ (iEdg‘{{{𝐴}}}) = {𝐴} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vtxval3sn.a | . 2 ⊢ 𝐴 ∈ V | |
2 | 1 | opid 4826 | . . . 4 ⊢ 〈𝐴, 𝐴〉 = {{𝐴}} |
3 | 2 | eqcomi 2833 | . . 3 ⊢ {{𝐴}} = 〈𝐴, 𝐴〉 |
4 | 3 | sneqi 4581 | . 2 ⊢ {{{𝐴}}} = {〈𝐴, 𝐴〉} |
5 | 1, 4 | iedgvalsnop 26830 | 1 ⊢ (iEdg‘{{{𝐴}}}) = {𝐴} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1536 ∈ wcel 2113 Vcvv 3497 {csn 4570 〈cop 4576 ‘cfv 6358 iEdgciedg 26785 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-iota 6317 df-fun 6360 df-fv 6366 df-2nd 7693 df-iedg 26787 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |