| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > umgr2v2eedg | Structured version Visualization version GIF version | ||
| Description: The set of edges in a multigraph with two edges connecting the same two vertices. (Contributed by AV, 17-Dec-2020.) |
| Ref | Expression |
|---|---|
| umgr2v2evtx.g | ⊢ 𝐺 = 〈𝑉, {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}〉 |
| Ref | Expression |
|---|---|
| umgr2v2eedg | ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (Edg‘𝐺) = {{𝐴, 𝐵}}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | edgval 29436 | . . 3 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (Edg‘𝐺) = ran (iEdg‘𝐺)) |
| 3 | umgr2v2evtx.g | . . . 4 ⊢ 𝐺 = 〈𝑉, {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}〉 | |
| 4 | 3 | umgr2v2eiedg 29910 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (iEdg‘𝐺) = {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}) |
| 5 | 4 | rneqd 5933 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran (iEdg‘𝐺) = ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}) |
| 6 | c0ex 11218 | . . . . 5 ⊢ 0 ∈ V | |
| 7 | 1ex 11221 | . . . . 5 ⊢ 1 ∈ V | |
| 8 | rnpropg 6228 | . . . . 5 ⊢ ((0 ∈ V ∧ 1 ∈ V) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}}) | |
| 9 | 6, 7, 8 | mp2an 705 | . . . 4 ⊢ ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}} |
| 10 | 9 | a1i 11 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}}) |
| 11 | dfsn2 4607 | . . 3 ⊢ {{𝐴, 𝐵}} = {{𝐴, 𝐵}, {𝐴, 𝐵}} | |
| 12 | 10, 11 | eqtr4di 2819 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}}) |
| 13 | 2, 5, 12 | 3eqtrd 2805 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (Edg‘𝐺) = {{𝐴, 𝐵}}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 Vcvv 3458 {csn 4594 {cpr 4596 〈cop 4600 ran crn 5667 ‘cfv 6543 0cc0 11118 1c1 11119 iEdgciedg 29384 Edgcedg 29434 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 ax-un 7745 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-mulcl 11180 ax-i2m1 11186 |
| 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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-iota 6499 df-fun 6545 df-fv 6551 df-2nd 7996 df-iedg 29386 df-edg 29435 |
| This theorem is used by: umgr2v2enb1 29913 |
| Copyright terms: Public domain | W3C validator |