Theorem usgruspgrben 16198

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

Assertion

Ref	Expression
usgruspgrben	⊢ (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o))

Distinct variable group:   𝑒,𝐺

Proof of Theorem usgruspgrben

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

Step	Hyp	Ref	Expression
1		usgruspgr 16195	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
2		edgusgren 16175	. . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑒 ∈ (Edg‘𝐺)) → (𝑒 ∈ 𝒫 (Vtx‘𝐺) ∧ 𝑒 ≈ 2o))
3	2	simprd 114	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑒 ∈ (Edg‘𝐺)) → 𝑒 ≈ 2o)
4	3	ralrimiva 2617	. . 3 ⊢ (𝐺 ∈ USGraph → ∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o)
5	1, 4	jca 306	. 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o))
6		edgvalg 16071	. . . . . 6 ⊢ (𝐺 ∈ USPGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
7	6	raleqdv 2749	. . . . 5 ⊢ (𝐺 ∈ USPGraph → (∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o ↔ ∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o))
8		eqid 2234	. . . . . . 7 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
9		eqid 2234	. . . . . . 7 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
10	8, 9	uspgrfen 16171	. . . . . 6 ⊢ (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)})
11		f1rn 5576	. . . . . . . . 9 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)})
12		ssel2 3235	. . . . . . . . . . . . . . 15 ⊢ ((ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∧ 𝑦 ∈ ran (iEdg‘𝐺)) → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)})
13	12	expcom 116	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)}))
14		breq1 4114	. . . . . . . . . . . . . . . 16 ⊢ (𝑒 = 𝑦 → (𝑒 ≈ 2o ↔ 𝑦 ≈ 2o))
15	14	rspcv 2919	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o → 𝑦 ≈ 2o))
16		breq1 4114	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑦 → (𝑥 ≈ 1o ↔ 𝑦 ≈ 1o))
17		breq1 4114	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑦 → (𝑥 ≈ 2o ↔ 𝑦 ≈ 2o))
18	16, 17	orbi12d 801	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → ((𝑥 ≈ 1o ∨ 𝑥 ≈ 2o) ↔ (𝑦 ≈ 1o ∨ 𝑦 ≈ 2o)))
19	18	elrab 2975	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ↔ (𝑦 ∈ 𝒫 (Vtx‘𝐺) ∧ (𝑦 ≈ 1o ∨ 𝑦 ≈ 2o)))
20	17	elrab 2975	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o} ↔ (𝑦 ∈ 𝒫 (Vtx‘𝐺) ∧ 𝑦 ≈ 2o))
21	20	simplbi2 385	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ 𝒫 (Vtx‘𝐺) → (𝑦 ≈ 2o → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
22	21	adantr 276	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ 𝒫 (Vtx‘𝐺) ∧ (𝑦 ≈ 1o ∨ 𝑦 ≈ 2o)) → (𝑦 ≈ 2o → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
23	19, 22	sylbi 121	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → (𝑦 ≈ 2o → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
24	15, 23	syl9 72	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → (∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})))
25	13, 24	syld 45	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ran (iEdg‘𝐺) → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → (∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})))
26	25	com13 80	. . . . . . . . . . . 12 ⊢ (∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → (𝑦 ∈ ran (iEdg‘𝐺) → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})))
27	26	imp 124	. . . . . . . . . . 11 ⊢ ((∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)}) → (𝑦 ∈ ran (iEdg‘𝐺) → 𝑦 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
28	27	ssrdv 3246	. . . . . . . . . 10 ⊢ ((∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)}) → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})
29	28	ex 115	. . . . . . . . 9 ⊢ (∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o → (ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
30	11, 29	mpan9 281	. . . . . . . 8 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∧ ∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o) → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})
31		f1ssr 5582	. . . . . . . 8 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})
32	30, 31	syldan 282	. . . . . . 7 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∧ ∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})
33	32	ex 115	. . . . . 6 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} → (∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
34	10, 33	syl 14	. . . . 5 ⊢ (𝐺 ∈ USPGraph → (∀𝑒 ∈ ran (iEdg‘𝐺)𝑒 ≈ 2o → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
35	7, 34	sylbid 150	. . . 4 ⊢ (𝐺 ∈ USPGraph → (∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
36	35	imp 124	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})
37	8, 9	isusgren 16170	. . . 4 ⊢ (𝐺 ∈ USPGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
38	37	adantr 276	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o) → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}))
39	36, 38	mpbird 167	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o) → 𝐺 ∈ USGraph)
40	5, 39	impbii 126	1 ⊢ (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)𝑒 ≈ 2o))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716   ∈ wcel 2205  ∀wral 2522  {crab 2526   ⊆ wss 3213  𝒫 cpw 3671   class class class wbr 4111  dom cdm 4751  ran crn 4752  –1-1→wf1 5351  ‘cfv 5354  1_oc1o 6642  2_oc2o 6643   ≈ cen 6975  Vtxcvtx 16024  iEdgciedg 16025  Edgcedg 16069  USPGraphcuspgr 16165  USGraphcusgr 16166

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-sub 8448  df-inn 9240  df-2 9298  df-3 9299  df-4 9300  df-5 9301  df-6 9302  df-7 9303  df-8 9304  df-9 9305  df-n0 9499  df-dec 9713  df-ndx 13232  df-slot 13233  df-base 13235  df-edgf 16017  df-vtx 16026  df-iedg 16027  df-edg 16070  df-uspgren 16167  df-usgren 16168

This theorem is referenced by:  usgr1e  16253