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

Theorem usgruspgr 29065
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 2725 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2725 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2isusgr 29038 . . . 4 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
4 2re 12319 . . . . . . . 8 2 ∈ ℝ
54eqlei2 11357 . . . . . . 7 ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)
65a1i 11 . . . . . 6 (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2))
76ss2rabi 4070 . . . . 5 {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}
8 f1ss 6798 . . . . 5 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
97, 8mpan2 689 . . . 4 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
103, 9biimtrdi 252 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
111, 2isuspgr 29037 . . 3 (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
1210, 11sylibrd 258 . 2 (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph))
1312pm2.43i 52 1 (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2098  {crab 3418  cdif 3941  wss 3944  c0 4322  𝒫 cpw 4604  {csn 4630   class class class wbr 5149  dom cdm 5678  1-1wf1 6546  cfv 6549  cle 11281  2c2 12300  chash 14325  Vtxcvtx 28881  iEdgciedg 28882  USPGraphcuspgr 29033  USGraphcusgr 29034
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741  ax-resscn 11197  ax-1cn 11198  ax-icn 11199  ax-addcl 11200  ax-addrcl 11201  ax-mulcl 11202  ax-mulrcl 11203  ax-i2m1 11208  ax-1ne0 11209  ax-rrecex 11212  ax-cnre 11213  ax-pre-lttri 11214  ax-pre-lttrn 11215
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-nel 3036  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-po 5590  df-so 5591  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-ov 7422  df-er 8725  df-en 8965  df-dom 8966  df-sdom 8967  df-pnf 11282  df-mnf 11283  df-xr 11284  df-ltxr 11285  df-le 11286  df-2 12308  df-uspgr 29035  df-usgr 29036
This theorem is referenced by:  usgrumgruspgr  29067  usgruspgrb  29068  usgrupgr  29070  usgrislfuspgr  29072  usgredg2vtxeu  29106  usgredgedg  29115  usgredgleord  29118  vtxdusgrfvedg  29377  usgrn2cycl  29692  wlksnfi  29790  rusgrnumwwlk  29858  rusgrnumwlkg  29860  clwlksndivn  29968  clwlknon2num  30250  numclwlk1lem2  30252
  Copyright terms: Public domain W3C validator