Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > uspgrloopvtxel | Structured version Visualization version GIF version |
Description: A vertex in a graph (simple pseudograph) with one edge which is a loop (see uspgr1v1eop 27012). (Contributed by AV, 17-Dec-2020.) |
Ref | Expression |
---|---|
uspgrloopvtx.g | ⊢ 𝐺 = 〈𝑉, {〈𝐴, {𝑁}〉}〉 |
Ref | Expression |
---|---|
uspgrloopvtxel | ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑁 ∈ 𝑉) → 𝑁 ∈ (Vtx‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uspgrloopvtx.g | . . 3 ⊢ 𝐺 = 〈𝑉, {〈𝐴, {𝑁}〉}〉 | |
2 | 1 | uspgrloopvtx 27278 | . 2 ⊢ (𝑉 ∈ 𝑊 → (Vtx‘𝐺) = 𝑉) |
3 | eleq2 2899 | . . . . 5 ⊢ (𝑉 = (Vtx‘𝐺) → (𝑁 ∈ 𝑉 ↔ 𝑁 ∈ (Vtx‘𝐺))) | |
4 | 3 | biimpd 231 | . . . 4 ⊢ (𝑉 = (Vtx‘𝐺) → (𝑁 ∈ 𝑉 → 𝑁 ∈ (Vtx‘𝐺))) |
5 | 4 | eqcoms 2828 | . . 3 ⊢ ((Vtx‘𝐺) = 𝑉 → (𝑁 ∈ 𝑉 → 𝑁 ∈ (Vtx‘𝐺))) |
6 | 5 | com12 32 | . 2 ⊢ (𝑁 ∈ 𝑉 → ((Vtx‘𝐺) = 𝑉 → 𝑁 ∈ (Vtx‘𝐺))) |
7 | 2, 6 | mpan9 509 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑁 ∈ 𝑉) → 𝑁 ∈ (Vtx‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {csn 4548 〈cop 4554 ‘cfv 6336 Vtxcvtx 26762 |
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 2792 ax-sep 5184 ax-nul 5191 ax-pow 5247 ax-pr 5311 ax-un 7442 |
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 2653 df-clab 2799 df-cleq 2813 df-clel 2891 df-nfc 2959 df-ral 3138 df-rex 3139 df-rab 3142 df-v 3483 df-sbc 3759 df-dif 3922 df-un 3924 df-in 3926 df-ss 3935 df-nul 4275 df-if 4449 df-sn 4549 df-pr 4551 df-op 4555 df-uni 4820 df-br 5048 df-opab 5110 df-mpt 5128 df-id 5441 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-iota 6295 df-fun 6338 df-fv 6344 df-1st 7670 df-vtx 26764 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |