Theorem usgruspgrb 29629

Description: A class is a simple graph iff it is a simple pseudograph without loops. (Contributed by AV, 18-Oct-2020.)

Assertion

Ref	Expression
usgruspgrb	⊢ (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2))

Distinct variable group:   𝑒,𝐺

Proof of Theorem usgruspgrb

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		usgruspgr 29626	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
2		edgusgr 29606	. . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑒 ∈ (Edg‘𝐺)) → (𝑒 ∈ 𝒫 (Vtx‘𝐺) ∧ (♯‘𝑒) = 2))
3	2	simprd 501	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑒 ∈ (Edg‘𝐺)) → (♯‘𝑒) = 2)
4	3	ralrimiva 3156	. . 3 ⊢ (𝐺 ∈ USGraph → ∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2)
5	1, 4	jca 521	. 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2))
6		edgval 29492	. . . . . . 7 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
7	6	a1i 11	. . . . . 6 ⊢ (𝐺 ∈ USPGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
8	7	raleqdv 3321	. . . . 5 ⊢ (𝐺 ∈ USPGraph → (∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2 ↔ ∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2))
9		eqid 2762	. . . . . . 7 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
10		eqid 2762	. . . . . . 7 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
11	9, 10	uspgrf 29600	. . . . . 6 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
12		f1f 6775	. . . . . . . . . 10 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
13	12	frnd 6715	. . . . . . . . 9 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
14		ssel2 3929	. . . . . . . . . . . . . . 15 ⊢ ((ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝑦 ∈ ran (iEdg‘𝐺)) → 𝑦 ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
15	14	expcom 419	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝑦 ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
16		fveqeq2 6891	. . . . . . . . . . . . . . . 16 ⊢ (𝑒 = 𝑦 → ((♯‘𝑒) = 2 ↔ (♯‘𝑦) = 2))
17	16	rspcv 3575	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 → (♯‘𝑦) = 2))
18		fveq2 6882	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑦 → (♯‘𝑥) = (♯‘𝑦))
19	18	breq1d 5117	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → ((♯‘𝑥) ≤ 2 ↔ (♯‘𝑦) ≤ 2))
20	19	elrab 3648	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ↔ (𝑦 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ (♯‘𝑦) ≤ 2))
21		eldifi 4081	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → 𝑦 ∈ 𝒫 (Vtx‘𝐺))
22	21	anim1i 627	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ (♯‘𝑦) = 2) → (𝑦 ∈ 𝒫 (Vtx‘𝐺) ∧ (♯‘𝑦) = 2))
23		fveqeq2 6891	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑦 → ((♯‘𝑥) = 2 ↔ (♯‘𝑦) = 2))
24	23	elrab 3648	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2} ↔ (𝑦 ∈ 𝒫 (Vtx‘𝐺) ∧ (♯‘𝑦) = 2))
25	22, 24	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ (♯‘𝑦) = 2) → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})
26	25	ex 418	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑦) = 2 → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
27	26	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ (♯‘𝑦) ≤ 2) → ((♯‘𝑦) = 2 → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
28	20, 27	sylbi 220	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → ((♯‘𝑦) = 2 → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
29	17, 28	syl9 78	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (𝑦 ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})))
30	15, 29	syld 48	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})))
31	30	com13 89	. . . . . . . . . . . 12 ⊢ (∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (𝑦 ∈ ran (iEdg‘𝐺) → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})))
32	31	imp 412	. . . . . . . . . . 11 ⊢ ((∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (𝑦 ∈ ran (iEdg‘𝐺) → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
33	32	ssrdv 3940	. . . . . . . . . 10 ⊢ ((∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})
34	33	ex 418	. . . . . . . . 9 ⊢ (∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
35	13, 34	mpan9 516	. . . . . . . 8 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ ∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2) → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})
36		f1ssr 6783	. . . . . . . 8 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})
37	35, 36	syldan 603	. . . . . . 7 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ ∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})
38	37	ex 418	. . . . . 6 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
39	11, 38	syl 18	. . . . 5 ⊢ (𝐺 ∈ USPGraph → (∀𝑒 ∈ ran (iEdg‘𝐺)(♯‘𝑒) = 2 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
40	8, 39	sylbid 243	. . . 4 ⊢ (𝐺 ∈ USPGraph → (∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
41	40	imp 412	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})
42	9, 10	isusgrs 29602	. . . 4 ⊢ (𝐺 ∈ USPGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
43	42	adantr 486	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2) → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}))
44	41, 43	mpbird 260	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2) → 𝐺 ∈ USGraph)
45	5, 44	impbii 212	1 ⊢ (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)(♯‘𝑒) = 2))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  {crab 3414   ∖ cdif 3899   ⊆ wss 3902  ∅c0 4282  𝒫 cpw 4560  {csn 4587   class class class wbr 5107  dom cdm 5659  ran crn 5660  –1-1→wf1 6534  ‘cfv 6537   ≤ cle 11271  2c2 12322  ♯chash 14396  Vtxcvtx 29439  iEdgciedg 29440  Edgcedg 29490  USPGraphcuspgr 29594  USGraphcusgr 29595

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  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-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-card 9947  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-2 12330  df-n0 12532  df-z 12619  df-uz 12891  df-fz 13564  df-hash 14397  df-edg 29491  df-uspgr 29596  df-usgr 29597

This theorem is used by:  usgr1e  29691