| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgruspgr | Structured version Visualization version GIF version | ||
| Description: A simple graph is a simple pseudograph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 15-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgruspgr | ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2731 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2731 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 1, 2 | isusgr 29131 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
| 4 | 2re 12199 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 5 | 4 | eqlei2 11224 | . . . . . . 7 ⊢ ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2) |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)) |
| 7 | 6 | ss2rabi 4023 | . . . . 5 ⊢ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} |
| 8 | f1ss 6724 | . . . . 5 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) | |
| 9 | 7, 8 | mpan2 691 | . . . 4 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 10 | 3, 9 | biimtrdi 253 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
| 11 | 1, 2 | isuspgr 29130 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
| 12 | 10, 11 | sylibrd 259 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)) |
| 13 | 12 | pm2.43i 52 | 1 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 {crab 3395 ∖ cdif 3894 ⊆ wss 3897 ∅c0 4280 𝒫 cpw 4547 {csn 4573 class class class wbr 5089 dom cdm 5614 –1-1→wf1 6478 ‘cfv 6481 ≤ cle 11147 2c2 12180 ♯chash 14237 Vtxcvtx 28974 iEdgciedg 28975 USPGraphcuspgr 29126 USGraphcusgr 29127 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-i2m1 11074 ax-1ne0 11075 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-po 5522 df-so 5523 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-2 12188 df-uspgr 29128 df-usgr 29129 |
| This theorem is referenced by: usgrumgruspgr 29160 usgruspgrb 29161 usgrupgr 29163 usgrislfuspgr 29165 usgredg2vtxeu 29199 usgredgedg 29208 usgredgleord 29211 vtxdusgrfvedg 29470 usgrn2cycl 29787 wlksnfi 29885 usgrwwlks2on 29936 wpthswwlks2on 29942 usgr2wspthon 29946 rusgrnumwwlk 29956 rusgrnumwlkg 29958 clwlksndivn 30066 clwlknon2num 30348 numclwlk1lem2 30350 isubgr3stgr 48014 usgrexmpl12ngrlic 48078 gpg5ngric 48167 |
| Copyright terms: Public domain | W3C validator |