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

Theorem usgrislfuspgr 25966
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
StepHypRef Expression
1 usgruspgr 25960 . . 3 (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph )
2 usgrislfuspgr.v . . . . 5 𝑉 = (Vtx‘𝐺)
3 usgrislfuspgr.i . . . . 5 𝐼 = (iEdg‘𝐺)
42, 3usgrfs 25940 . . . 4 (𝐺 ∈ USGraph → 𝐼:dom 𝐼1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
5 f1f 6060 . . . . 5 (𝐼:dom 𝐼1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
6 2re 11035 . . . . . . . . . . 11 2 ∈ ℝ
76leidi 10507 . . . . . . . . . 10 2 ≤ 2
87a1i 11 . . . . . . . . 9 ((#‘𝑥) = 2 → 2 ≤ 2)
9 breq2 4622 . . . . . . . . 9 ((#‘𝑥) = 2 → (2 ≤ (#‘𝑥) ↔ 2 ≤ 2))
108, 9mpbird 247 . . . . . . . 8 ((#‘𝑥) = 2 → 2 ≤ (#‘𝑥))
1110a1i 11 . . . . . . 7 (𝑥 ∈ 𝒫 𝑉 → ((#‘𝑥) = 2 → 2 ≤ (#‘𝑥)))
1211ss2rabi 3668 . . . . . 6 {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}
1312a1i 11 . . . . 5 (𝐼:dom 𝐼1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)})
145, 13fssd 6016 . . . 4 (𝐼:dom 𝐼1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)})
154, 14syl 17 . . 3 (𝐺 ∈ USGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)})
161, 15jca 554 . 2 (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}))
172, 3uspgrf 25937 . . . 4 (𝐺 ∈ USPGraph → 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
18 df-f1 5855 . . . . . 6 (𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ Fun 𝐼))
19 fin 6044 . . . . . . . . . . 11 (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}))
20 umgrislfupgrlem 25907 . . . . . . . . . . . 12 ({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}
21 feq3 5987 . . . . . . . . . . . 12 (({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2} → (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
2220, 21ax-mp 5 . . . . . . . . . . 11 (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})
2319, 22sylbb1 227 . . . . . . . . . 10 ((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})
2423anim1i 591 . . . . . . . . 9 (((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ∧ Fun 𝐼) → (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2} ∧ Fun 𝐼))
25 df-f1 5855 . . . . . . . . 9 (𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2} ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2} ∧ Fun 𝐼))
2624, 25sylibr 224 . . . . . . . 8 (((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ∧ Fun 𝐼) → 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})
2726ex 450 . . . . . . 7 ((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → (Fun 𝐼𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
2827impancom 456 . . . . . 6 ((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ Fun 𝐼) → (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)} → 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
2918, 28sylbi 207 . . . . 5 (𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} → (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)} → 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
3029imp 445 . . . 4 ((𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})
3117, 30sylan 488 . . 3 ((𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})
322, 3isusgr 25936 . . . 4 (𝐺 ∈ USPGraph → (𝐺 ∈ USGraph ↔ 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
3332adantr 481 . . 3 ((𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → (𝐺 ∈ USGraph ↔ 𝐼:dom 𝐼1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
3431, 33mpbird 247 . 2 ((𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → 𝐺 ∈ USGraph )
3516, 34impbii 199 1 (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1992  {crab 2916  cdif 3557  cin 3559  wss 3560  c0 3896  𝒫 cpw 4135  {csn 4153   class class class wbr 4618  ccnv 5078  dom cdm 5079  Fun wfun 5844  wf 5846  1-1wf1 5847  cfv 5850  cle 10020  2c2 11015  #chash 13054  Vtxcvtx 25769  iEdgciedg 25770   USPGraph cuspgr 25931   USGraph cusgr 25932
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-8 1994  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6903  ax-cnex 9937  ax-resscn 9938  ax-1cn 9939  ax-icn 9940  ax-addcl 9941  ax-addrcl 9942  ax-mulcl 9943  ax-mulrcl 9944  ax-mulcom 9945  ax-addass 9946  ax-mulass 9947  ax-distr 9948  ax-i2m1 9949  ax-1ne0 9950  ax-1rid 9951  ax-rnegex 9952  ax-rrecex 9953  ax-cnre 9954  ax-pre-lttri 9955  ax-pre-lttrn 9956  ax-pre-ltadd 9957  ax-pre-mulgt0 9958
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-ne 2797  df-nel 2900  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3193  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5642  df-ord 5688  df-on 5689  df-lim 5690  df-suc 5691  df-iota 5813  df-fun 5852  df-fn 5853  df-f 5854  df-f1 5855  df-fo 5856  df-f1o 5857  df-fv 5858  df-riota 6566  df-ov 6608  df-oprab 6609  df-mpt2 6610  df-om 7014  df-1st 7116  df-2nd 7117  df-wrecs 7353  df-recs 7414  df-rdg 7452  df-1o 7506  df-er 7688  df-en 7901  df-dom 7902  df-sdom 7903  df-fin 7904  df-card 8710  df-pnf 10021  df-mnf 10022  df-xr 10023  df-ltxr 10024  df-le 10025  df-sub 10213  df-neg 10214  df-nn 10966  df-2 11024  df-n0 11238  df-xnn0 11309  df-z 11323  df-uz 11632  df-fz 12266  df-hash 13055  df-uspgr 25933  df-usgr 25934
This theorem is referenced by:  usgr1vr  26034
  Copyright terms: Public domain W3C validator