Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > umgrupgr | Structured version Visualization version GIF version |
Description: An undirected multigraph is an undirected pseudograph. (Contributed by AV, 25-Nov-2020.) |
Ref | Expression |
---|---|
umgrupgr | ⊢ (𝐺 ∈ UMGraph → 𝐺 ∈ UPGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2798 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | eqid 2798 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
3 | 1, 2 | isumgr 26888 | . . . 4 ⊢ (𝐺 ∈ UMGraph → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
4 | id 22 | . . . . 5 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) | |
5 | 2re 11699 | . . . . . . . . . . 11 ⊢ 2 ∈ ℝ | |
6 | 5 | leidi 11163 | . . . . . . . . . 10 ⊢ 2 ≤ 2 |
7 | 6 | a1i 11 | . . . . . . . . 9 ⊢ ((♯‘𝑥) = 2 → 2 ≤ 2) |
8 | breq1 5033 | . . . . . . . . 9 ⊢ ((♯‘𝑥) = 2 → ((♯‘𝑥) ≤ 2 ↔ 2 ≤ 2)) | |
9 | 7, 8 | mpbird 260 | . . . . . . . 8 ⊢ ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2) |
10 | 9 | a1i 11 | . . . . . . 7 ⊢ (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)) |
11 | 10 | ss2rabi 4004 | . . . . . 6 ⊢ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} |
12 | 11 | a1i 11 | . . . . 5 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
13 | 4, 12 | fssd 6502 | . . . 4 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
14 | 3, 13 | syl6bi 256 | . . 3 ⊢ (𝐺 ∈ UMGraph → (𝐺 ∈ UMGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
15 | 14 | pm2.43i 52 | . 2 ⊢ (𝐺 ∈ UMGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
16 | 1, 2 | isupgr 26877 | . 2 ⊢ (𝐺 ∈ UMGraph → (𝐺 ∈ UPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
17 | 15, 16 | mpbird 260 | 1 ⊢ (𝐺 ∈ UMGraph → 𝐺 ∈ UPGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 {crab 3110 ∖ cdif 3878 ⊆ wss 3881 ∅c0 4243 𝒫 cpw 4497 {csn 4525 class class class wbr 5030 dom cdm 5519 ⟶wf 6320 ‘cfv 6324 ≤ cle 10665 2c2 11680 ♯chash 13686 Vtxcvtx 26789 iEdgciedg 26790 UPGraphcupgr 26873 UMGraphcumgr 26874 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-i2m1 10594 ax-1ne0 10595 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-2 11688 df-upgr 26875 df-umgr 26876 |
This theorem is referenced by: umgruhgr 26897 upgr0e 26904 umgrislfupgr 26916 nbumgrvtx 27136 umgrwlknloop 27438 umgrwwlks2on 27743 umgr3v3e3cycl 27969 konigsberg 28042 |
Copyright terms: Public domain | W3C validator |