![]() |
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 29084 | . . 3 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
2 | 1 | a1i 11 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (Edg‘𝐺) = ran (iEdg‘𝐺)) |
3 | umgr2v2evtx.g | . . . 4 ⊢ 𝐺 = 〈𝑉, {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}〉 | |
4 | 3 | umgr2v2eiedg 29559 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (iEdg‘𝐺) = {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}) |
5 | 4 | rneqd 5963 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran (iEdg‘𝐺) = ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉}) |
6 | c0ex 11284 | . . . . 5 ⊢ 0 ∈ V | |
7 | 1ex 11286 | . . . . 5 ⊢ 1 ∈ V | |
8 | rnpropg 6253 | . . . . 5 ⊢ ((0 ∈ V ∧ 1 ∈ V) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}}) | |
9 | 6, 7, 8 | mp2an 691 | . . . 4 ⊢ ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}} |
10 | 9 | a1i 11 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}, {𝐴, 𝐵}}) |
11 | dfsn2 4661 | . . 3 ⊢ {{𝐴, 𝐵}} = {{𝐴, 𝐵}, {𝐴, 𝐵}} | |
12 | 10, 11 | eqtr4di 2798 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ran {〈0, {𝐴, 𝐵}〉, 〈1, {𝐴, 𝐵}〉} = {{𝐴, 𝐵}}) |
13 | 2, 5, 12 | 3eqtrd 2784 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (Edg‘𝐺) = {{𝐴, 𝐵}}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 Vcvv 3488 {csn 4648 {cpr 4650 〈cop 4654 ran crn 5701 ‘cfv 6573 0cc0 11184 1c1 11185 iEdgciedg 29032 Edgcedg 29082 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-un 7770 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-mulcl 11246 ax-i2m1 11252 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-iota 6525 df-fun 6575 df-fv 6581 df-2nd 8031 df-iedg 29034 df-edg 29083 |
This theorem is referenced by: umgr2v2enb1 29562 |
Copyright terms: Public domain | W3C validator |