Theorem usgruspgr 26073

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.

Step	Hyp	Ref	Expression
1		eqid 2622	. . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		eqid 2622	. . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
3	1, 2	isusgr 26048	. . . 4 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2}))
4		2re 11090	. . . . . . . 8 ⊢ 2 ∈ ℝ
5	4	eqlei2 10148	. . . . . . 7 ⊢ ((#‘𝑥) = 2 → (#‘𝑥) ≤ 2)
6	5	a1i 11	. . . . . 6 ⊢ (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((#‘𝑥) = 2 → (#‘𝑥) ≤ 2))
7	6	ss2rabi 3684	. . . . 5 ⊢ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}
8		f1ss 6106	. . . . 5 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
9	7, 8	mpan2 707	. . . 4 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
10	3, 9	syl6bi 243	. . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
11	1, 2	isuspgr 26047	. . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
12	10, 11	sylibrd 249	. 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph ))
13	12	pm2.43i 52	1 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph )

Syntax hints:   → wi 4   = wceq 1483   ∈ wcel 1990  {crab 2916   ∖ cdif 3571   ⊆ wss 3574  ∅c0 3915  𝒫 cpw 4158  {csn 4177   class class class wbr 4653  dom cdm 5114  –1-1→wf1 5885  ‘cfv 5888   ≤ cle 10075  2c2 11070  #chash 13117  Vtxcvtx 25874  iEdgciedg 25875   USPGraph cuspgr 26043   USGraph cusgr 26044

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-i2m1 10004  ax-1ne0 10005  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-2 11079  df-uspgr 26045  df-usgr 26046

This theorem is referenced by:  usgrumgruspgr  26075  usgruspgrb  26076  usgrupgr  26077  usgrislfuspgr  26079  usgredg2vtxeu  26113  usgredgedg  26122  usgredgleord  26125  vtxdusgrfvedg  26387  usgrn2cycl  26701  wlksnfi  26802  wlksnwwlknvbij  26803  rusgrnumwwlk  26870  clwlksfoclwwlk  26963  clwlksf1clwwlk  26969