MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  usgruspgr Structured version   Visualization version   GIF version

Theorem usgruspgr 29267
Description: A simple graph is a simple pseudograph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 15-Oct-2020.)
Assertion
Ref Expression
usgruspgr (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)

Proof of Theorem usgruspgr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2739 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2739 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2isusgr 29240 . . . 4 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
4 2re 12246 . . . . . . . 8 2 ∈ ℝ
54eqlei2 11248 . . . . . . 7 ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)
65a1i 11 . . . . . 6 (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2))
76ss2rabi 4007 . . . . 5 {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}
8 f1ss 6728 . . . . 5 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
97, 8mpan2 697 . . . 4 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
103, 9biimtrdi 254 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
111, 2isuspgr 29239 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
1210, 11sylibrd 260 . 2 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph))
1312pm2.43i 52 1 (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  {crab 3391  cdif 3880  wss 3883  c0 4261  𝒫 cpw 4529  {csn 4555   class class class wbr 5072  dom cdm 5618  1-1wf1 6482  cfv 6485  cle 11171  2c2 12227  chash 14283  Vtxcvtx 29083  iEdgciedg 29084  USPGraphcuspgr 29235  USGraphcusgr 29236
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-i2m1 11097  ax-1ne0 11098  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-po 5526  df-so 5527  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-2 12235  df-uspgr 29237  df-usgr 29238
This theorem is referenced by:  usgrumgruspgr  29269  usgruspgrb  29270  usgrupgr  29272  usgrislfuspgr  29274  usgredg2vtxeu  29308  usgredgedg  29317  usgredgleord  29320  vtxdusgrfvedg  29578  usgrn2cycl  29895  wlksnfi  29993  usgrwwlks2on  30044  wpthswwlks2on  30050  usgr2wspthon  30054  rusgrnumwwlk  30064  rusgrnumwlkg  30066  clwlksndivn  30174  clwlknon2num  30456  numclwlk1lem2  30458  isubgr3stgr  48466  usgrexmpl12ngrlic  48530  gpg5ngric  48619
  Copyright terms: Public domain W3C validator