Theorem usgrislfuspgr 29274

Description: A simple graph is a loop-free simple pseudograph. (Contributed by AV, 27-Jan-2021.)

Hypotheses

Ref	Expression
usgrislfuspgr.v	⊢ 𝑉 = (Vtx‘𝐺)
usgrislfuspgr.i	⊢ 𝐼 = (iEdg‘𝐺)

Assertion

Ref	Expression
usgrislfuspgr	⊢ (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}))

Distinct variable groups:   𝑥,𝐺   𝑥,𝑉

Allowed substitution hint:   𝐼(𝑥)

Proof of Theorem usgrislfuspgr

Step	Hyp	Ref	Expression
1		usgruspgr 29267	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
2		usgrislfuspgr.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
3		usgrislfuspgr.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
4	2, 3	usgrfs 29244	. . . 4 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2})
5		f1f 6732	. . . . 5 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2})
6		2re 12250	. . . . . . . . . . 11 ⊢ 2 ∈ ℝ
7	6	leidi 11679	. . . . . . . . . 10 ⊢ 2 ≤ 2
8	7	a1i 11	. . . . . . . . 9 ⊢ ((♯‘𝑥) = 2 → 2 ≤ 2)
9		breq2 5090	. . . . . . . . 9 ⊢ ((♯‘𝑥) = 2 → (2 ≤ (♯‘𝑥) ↔ 2 ≤ 2))
10	8, 9	mpbird 257	. . . . . . . 8 ⊢ ((♯‘𝑥) = 2 → 2 ≤ (♯‘𝑥))
11	10	a1i 11	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑉 → ((♯‘𝑥) = 2 → 2 ≤ (♯‘𝑥)))
12	11	ss2rabi 4017	. . . . . 6 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}
13	12	a1i 11	. . . . 5 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} → {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)})
14	5, 13	fssd 6681	. . . 4 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)})
15	4, 14	syl 17	. . 3 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)})
16	1, 15	jca 511	. 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}))
17	2, 3	uspgrf 29241	. . . 4 ⊢ (𝐺 ∈ USPGraph → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
18		df-f1 6499	. . . . . 6 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ Fun ◡𝐼))
19		fin 6716	. . . . . . . . . . 11 ⊢ (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}))
20		umgrislfupgrlem 29209	. . . . . . . . . . . 12 ⊢ ({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}
21		feq3 6644	. . . . . . . . . . . 12 ⊢ (({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2} → (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}))
22	20, 21	ax-mp 5	. . . . . . . . . . 11 ⊢ (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2})
23	19, 22	sylbb1 237	. . . . . . . . . 10 ⊢ ((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) → 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2})
24	23	anim1i 616	. . . . . . . . 9 ⊢ (((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) ∧ Fun ◡𝐼) → (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ Fun ◡𝐼))
25		df-f1 6499	. . . . . . . . 9 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2} ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ Fun ◡𝐼))
26	24, 25	sylibr 234	. . . . . . . 8 ⊢ (((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) ∧ Fun ◡𝐼) → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2})
27	26	ex 412	. . . . . . 7 ⊢ ((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) → (Fun ◡𝐼 → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}))
28	27	impancom 451	. . . . . 6 ⊢ ((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ Fun ◡𝐼) → (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}))
29	18, 28	sylbi 217	. . . . 5 ⊢ (𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}))
30	29	imp 406	. . . 4 ⊢ ((𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2})
31	17, 30	sylan 581	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) → 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2})
32	2, 3	isusgr 29240	. . . 4 ⊢ (𝐺 ∈ USPGraph → (𝐺 ∈ USGraph ↔ 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}))
33	32	adantr 480	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) → (𝐺 ∈ USGraph ↔ 𝐼:dom 𝐼–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}))
34	31, 33	mpbird 257	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) → 𝐺 ∈ USGraph)
35	16, 34	impbii 209	1 ⊢ (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {crab 3390   ∖ cdif 3887   ∩ cin 3889   ⊆ wss 3890  ∅c0 4274  𝒫 cpw 4542  {csn 4568   class class class wbr 5086  ^◡ccnv 5625  dom cdm 5626  Fun wfun 6488  ⟶wf 6490  –1-1→wf1 6491  ‘cfv 6494   ≤ cle 11175  2c2 12231  ♯chash 14287  Vtxcvtx 29083  iEdgciedg 29084  USPGraphcuspgr 29235  USGraphcusgr 29236

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684  ax-cnex 11089  ax-resscn 11090  ax-1cn 11091  ax-icn 11092  ax-addcl 11093  ax-addrcl 11094  ax-mulcl 11095  ax-mulrcl 11096  ax-mulcom 11097  ax-addass 11098  ax-mulass 11099  ax-distr 11100  ax-i2m1 11101  ax-1ne0 11102  ax-1rid 11103  ax-rnegex 11104  ax-rrecex 11105  ax-cnre 11106  ax-pre-lttri 11107  ax-pre-lttrn 11108  ax-pre-ltadd 11109  ax-pre-mulgt0 11110

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-ord 6322  df-on 6323  df-lim 6324  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-riota 7319  df-ov 7365  df-oprab 7366  df-mpo 7367  df-om 7813  df-1st 7937  df-2nd 7938  df-frecs 8226  df-wrecs 8257  df-recs 8306  df-rdg 8344  df-1o 8400  df-er 8638  df-en 8889  df-dom 8890  df-sdom 8891  df-fin 8892  df-card 9858  df-pnf 11176  df-mnf 11177  df-xr 11178  df-ltxr 11179  df-le 11180  df-sub 11374  df-neg 11375  df-nn 12170  df-2 12239  df-n0 12433  df-xnn0 12506  df-z 12520  df-uz 12784  df-fz 13457  df-hash 14288  df-uspgr 29237  df-usgr 29238

This theorem is referenced by:  usgr1vr  29342