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

Theorem usgruspgr 29253
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 2736 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2736 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2isusgr 29226 . . . 4 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
4 2re 12219 . . . . . . . 8 2 ∈ ℝ
54eqlei2 11244 . . . . . . 7 ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)
65a1i 11 . . . . . 6 (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2))
76ss2rabi 4028 . . . . 5 {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}
8 f1ss 6735 . . . . 5 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
97, 8mpan2 691 . . . 4 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
103, 9biimtrdi 253 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
111, 2isuspgr 29225 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
1210, 11sylibrd 259 . 2 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph))
1312pm2.43i 52 1 (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  {crab 3399  cdif 3898  wss 3901  c0 4285  𝒫 cpw 4554  {csn 4580   class class class wbr 5098  dom cdm 5624  1-1wf1 6489  cfv 6492  cle 11167  2c2 12200  chash 14253  Vtxcvtx 29069  iEdgciedg 29070  USPGraphcuspgr 29221  USGraphcusgr 29222
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-i2m1 11094  ax-1ne0 11095  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-po 5532  df-so 5533  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-er 8635  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-2 12208  df-uspgr 29223  df-usgr 29224
This theorem is referenced by:  usgrumgruspgr  29255  usgruspgrb  29256  usgrupgr  29258  usgrislfuspgr  29260  usgredg2vtxeu  29294  usgredgedg  29303  usgredgleord  29306  vtxdusgrfvedg  29565  usgrn2cycl  29882  wlksnfi  29980  usgrwwlks2on  30031  wpthswwlks2on  30037  usgr2wspthon  30041  rusgrnumwwlk  30051  rusgrnumwlkg  30053  clwlksndivn  30161  clwlknon2num  30443  numclwlk1lem2  30445  isubgr3stgr  48221  usgrexmpl12ngrlic  48285  gpg5ngric  48374
  Copyright terms: Public domain W3C validator