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

Theorem usgruspgr 29470
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 2769 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2769 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2isusgr 29443 . . . 4 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
4 2re 12314 . . . . . . . 8 2 ∈ ℝ
54eqlei2 11320 . . . . . . 7 ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)
65a1i 11 . . . . . 6 (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2))
76ss2rabi 4038 . . . . 5 {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}
8 f1ss 6782 . . . . 5 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
97, 8mpan2 703 . . . 4 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
103, 9biimtrdi 256 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
111, 2isuspgr 29442 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
1210, 11sylibrd 262 . 2 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph))
1312pm2.43i 53 1 (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  {crab 3423  cdif 3910  wss 3913  c0 4294  𝒫 cpw 4567  {csn 4594   class class class wbr 5113  dom cdm 5662  1-1wf1 6534  cfv 6537  cle 11243  2c2 12294  chash 14365  Vtxcvtx 29286  iEdgciedg 29287  USPGraphcuspgr 29438  USGraphcusgr 29439
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-resscn 11156  ax-1cn 11157  ax-icn 11158  ax-addcl 11159  ax-addrcl 11160  ax-mulcl 11161  ax-mulrcl 11162  ax-i2m1 11167  ax-1ne0 11168  ax-rrecex 11171  ax-cnre 11172  ax-pre-lttri 11173  ax-pre-lttrn 11174
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-po 5570  df-so 5571  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-er 8693  df-en 8943  df-dom 8944  df-sdom 8945  df-pnf 11244  df-mnf 11245  df-xr 11246  df-ltxr 11247  df-le 11248  df-2 12302  df-uspgr 29440  df-usgr 29441
This theorem is referenced by:  usgrumgruspgr  29472  usgruspgrb  29473  usgrupgr  29475  usgrislfuspgr  29477  usgredg2vtxeu  29511  usgredgedg  29520  usgredgleord  29523  vtxdusgrfvedg  29781  usgrn2cycl  30098  wlksnfi  30196  usgrwwlks2on  30247  wpthswwlks2on  30253  usgr2wspthon  30257  rusgrnumwwlk  30267  rusgrnumwlkg  30269  clwlksndivn  30377  clwlknon2num  30659  numclwlk1lem2  30661  isubgr3stgr  48628  usgrexmpl12ngrlic  48692  gpg5ngric  48781
  Copyright terms: Public domain W3C validator