| 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 29028 | . . 3 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (Edg‘𝐺) = ran (iEdg‘𝐺)) |
| 3 | umgr2v2evtx.g | . . . 4 ⊢ 𝐺 = 〈𝑉, {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}〉 | |
| 4 | 3 | umgr2v2eiedg 29503 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (iEdg‘𝐺) = {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}) |
| 5 | 4 | rneqd 5918 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran (iEdg‘𝐺) = ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}) |
| 6 | c0ex 11229 | . . . . 5 ⊢ 0 ∈ V | |
| 7 | 1ex 11231 | . . . . 5 ⊢ 1 ∈ V | |
| 8 | rnpropg 6211 | . . . . 5 ⊢ ((0 ∈ V ∧ 1 ∈ V) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}}) | |
| 9 | 6, 7, 8 | mp2an 692 | . . . 4 ⊢ ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}} |
| 10 | 9 | a1i 11 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}}) |
| 11 | dfsn2 4614 | . . 3 ⊢ {{𝐴, 𝐵}} = {{𝐴, 𝐵}, {𝐴, 𝐵}} | |
| 12 | 10, 11 | eqtr4di 2788 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}}) |
| 13 | 2, 5, 12 | 3eqtrd 2774 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (Edg‘𝐺) = {{𝐴, 𝐵}}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 Vcvv 3459 {csn 4601 {cpr 4603 〈cop 4607 ran crn 5655 ‘cfv 6531 0cc0 11129 1c1 11130 iEdgciedg 28976 Edgcedg 29026 |
| 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 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 ax-un 7729 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-mulcl 11191 ax-i2m1 11197 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-iota 6484 df-fun 6533 df-fv 6539 df-2nd 7989 df-iedg 28978 df-edg 29027 |
| This theorem is referenced by: umgr2v2enb1 29506 |
| Copyright terms: Public domain | W3C validator |