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

Theorem isupgr 25960
 Description: The property of being an undirected pseudograph. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 10-Oct-2020.)
Hypotheses
Ref Expression
isupgr.v 𝑉 = (Vtx‘𝐺)
isupgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
isupgr (𝐺𝑈 → (𝐺 ∈ UPGraph ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
Distinct variable groups:   𝑥,𝐺   𝑥,𝑉
Allowed substitution hints:   𝑈(𝑥)   𝐸(𝑥)

Proof of Theorem isupgr
Dummy variables 𝑒 𝑔 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-upgr 25958 . . 3 UPGraph = {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}}
21eleq2i 2691 . 2 (𝐺 ∈ UPGraph ↔ 𝐺 ∈ {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}})
3 fveq2 6178 . . . . 5 ( = 𝐺 → (iEdg‘) = (iEdg‘𝐺))
4 isupgr.e . . . . 5 𝐸 = (iEdg‘𝐺)
53, 4syl6eqr 2672 . . . 4 ( = 𝐺 → (iEdg‘) = 𝐸)
63dmeqd 5315 . . . . 5 ( = 𝐺 → dom (iEdg‘) = dom (iEdg‘𝐺))
74eqcomi 2629 . . . . . 6 (iEdg‘𝐺) = 𝐸
87dmeqi 5314 . . . . 5 dom (iEdg‘𝐺) = dom 𝐸
96, 8syl6eq 2670 . . . 4 ( = 𝐺 → dom (iEdg‘) = dom 𝐸)
10 fveq2 6178 . . . . . . . 8 ( = 𝐺 → (Vtx‘) = (Vtx‘𝐺))
11 isupgr.v . . . . . . . 8 𝑉 = (Vtx‘𝐺)
1210, 11syl6eqr 2672 . . . . . . 7 ( = 𝐺 → (Vtx‘) = 𝑉)
1312pweqd 4154 . . . . . 6 ( = 𝐺 → 𝒫 (Vtx‘) = 𝒫 𝑉)
1413difeq1d 3719 . . . . 5 ( = 𝐺 → (𝒫 (Vtx‘) ∖ {∅}) = (𝒫 𝑉 ∖ {∅}))
1514rabeqdv 3189 . . . 4 ( = 𝐺 → {𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) ≤ 2} = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
165, 9, 15feq123d 6021 . . 3 ( = 𝐺 → ((iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
17 fvexd 6190 . . . . 5 (𝑔 = → (Vtx‘𝑔) ∈ V)
18 fveq2 6178 . . . . 5 (𝑔 = → (Vtx‘𝑔) = (Vtx‘))
19 fvexd 6190 . . . . . 6 ((𝑔 = 𝑣 = (Vtx‘)) → (iEdg‘𝑔) ∈ V)
20 fveq2 6178 . . . . . . 7 (𝑔 = → (iEdg‘𝑔) = (iEdg‘))
2120adantr 481 . . . . . 6 ((𝑔 = 𝑣 = (Vtx‘)) → (iEdg‘𝑔) = (iEdg‘))
22 simpr 477 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → 𝑒 = (iEdg‘))
2322dmeqd 5315 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → dom 𝑒 = dom (iEdg‘))
24 pweq 4152 . . . . . . . . . 10 (𝑣 = (Vtx‘) → 𝒫 𝑣 = 𝒫 (Vtx‘))
2524ad2antlr 762 . . . . . . . . 9 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → 𝒫 𝑣 = 𝒫 (Vtx‘))
2625difeq1d 3719 . . . . . . . 8 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → (𝒫 𝑣 ∖ {∅}) = (𝒫 (Vtx‘) ∖ {∅}))
2726rabeqdv 3189 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → {𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} = {𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
2822, 23, 27feq123d 6021 . . . . . 6 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → (𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
2919, 21, 28sbcied2 3467 . . . . 5 ((𝑔 = 𝑣 = (Vtx‘)) → ([(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
3017, 18, 29sbcied2 3467 . . . 4 (𝑔 = → ([(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
3130cbvabv 2745 . . 3 {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}} = { ∣ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}}
3216, 31elab2g 3347 . 2 (𝐺𝑈 → (𝐺 ∈ {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}} ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
332, 32syl5bb 272 1 (𝐺𝑈 → (𝐺 ∈ UPGraph ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1481   ∈ wcel 1988  {cab 2606  {crab 2913  Vcvv 3195  [wsbc 3429   ∖ cdif 3564  ∅c0 3907  𝒫 cpw 4149  {csn 4168   class class class wbr 4644  dom cdm 5104  ⟶wf 5872  ‘cfv 5876   ≤ cle 10060  2c2 11055  #chash 13100  Vtxcvtx 25855  iEdgciedg 25856   UPGraph cupgr 25956 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-nul 4780 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-pw 4151  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-fv 5884  df-upgr 25958 This theorem is referenced by:  wrdupgr  25961  upgrf  25962  upgrop  25970  umgrupgr  25979  upgr1e  25989  upgrun  25994  uspgrupgr  26052  subupgr  26160  upgrres  26179  upgrres1  26186
 Copyright terms: Public domain W3C validator