| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uspgrloopedg | Structured version Visualization version GIF version | ||
| Description: The set of edges in a graph (simple pseudograph) with one edge which is a loop (see uspgr1v1eop 29857) is a singleton of a singleton. (Contributed by AV, 17-Dec-2020.) |
| Ref | Expression |
|---|---|
| uspgrloopvtx.g | ⊢ 𝐺 = 〈𝑉, {〈𝐴, {𝑁}〉}〉 |
| Ref | Expression |
|---|---|
| uspgrloopedg | ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) → (Edg‘𝐺) = {{𝑁}}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uspgrloopvtx.g | . . . 4 ⊢ 𝐺 = 〈𝑉, {〈𝐴, {𝑁}〉}〉 | |
| 2 | 1 | fveq2i 6908 | . . 3 ⊢ (Edg‘𝐺) = (Edg‘〈𝑉, {〈𝐴, {𝑁}〉}〉) |
| 3 | snex 5401 | . . . . 5 ⊢ {〈𝐴, {𝑁}〉} ∈ V | |
| 4 | 3 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ 𝑋 → {〈𝐴, {𝑁}〉} ∈ V) |
| 5 | edgopval 29656 | . . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ {〈𝐴, {𝑁}〉} ∈ V) → (Edg‘〈𝑉, {〈𝐴, {𝑁}〉}〉) = ran {〈𝐴, {𝑁}〉}) | |
| 6 | 4, 5 | sylan2 605 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) → (Edg‘〈𝑉, {〈𝐴, {𝑁}〉}〉) = ran {〈𝐴, {𝑁}〉}) |
| 7 | 2, 6 | eqtrid 2810 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) → (Edg‘𝐺) = ran {〈𝐴, {𝑁}〉}) |
| 8 | rnsnopg 6234 | . . 3 ⊢ (𝐴 ∈ 𝑋 → ran {〈𝐴, {𝑁}〉} = {{𝑁}}) | |
| 9 | 8 | adantl 487 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) → ran {〈𝐴, {𝑁}〉} = {{𝑁}}) |
| 10 | 7, 9 | eqtrd 2798 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) → (Edg‘𝐺) = {{𝑁}}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 {csn 4588 〈cop 4838 ran crn 5656 ‘cfv 6555 Edgcedg 29652 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6509 df-fun 6557 df-fv 6563 df-2nd 8023 df-iedg 29604 df-edg 29653 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |