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

Theorem fusgrfis 27927
Description: A finite simple graph is of finite size, i.e. has a finite number of edges. (Contributed by Alexander van der Vekens, 6-Jan-2018.) (Revised by AV, 8-Nov-2020.)
Assertion
Ref Expression
fusgrfis (𝐺 ∈ FinUSGraph → (Edg‘𝐺) ∈ Fin)

Proof of Theorem fusgrfis
Dummy variables 𝑒 𝑓 𝑛 𝑝 𝑞 𝑣 𝑦 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
21isfusgr 27915 . 2 (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin))
3 usgrop 27763 . . . 4 (𝐺 ∈ USGraph → ⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ USGraph)
4 fvex 6832 . . . . 5 (iEdg‘𝐺) ∈ V
5 mptresid 5984 . . . . . 6 ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) = (𝑞 ∈ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝} ↦ 𝑞)
6 fvex 6832 . . . . . . 7 (Edg‘⟨𝑣, 𝑒⟩) ∈ V
76mptrabex 7151 . . . . . 6 (𝑞 ∈ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝} ↦ 𝑞) ∈ V
85, 7eqeltri 2833 . . . . 5 ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) ∈ V
9 eleq1 2824 . . . . . 6 (𝑒 = (iEdg‘𝐺) → (𝑒 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
109adantl 482 . . . . 5 ((𝑣 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → (𝑒 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
11 eleq1 2824 . . . . . 6 (𝑒 = 𝑓 → (𝑒 ∈ Fin ↔ 𝑓 ∈ Fin))
1211adantl 482 . . . . 5 ((𝑣 = 𝑤𝑒 = 𝑓) → (𝑒 ∈ Fin ↔ 𝑓 ∈ Fin))
13 vex 3445 . . . . . . . 8 𝑣 ∈ V
14 vex 3445 . . . . . . . 8 𝑒 ∈ V
1513, 14opvtxfvi 27609 . . . . . . 7 (Vtx‘⟨𝑣, 𝑒⟩) = 𝑣
1615eqcomi 2745 . . . . . 6 𝑣 = (Vtx‘⟨𝑣, 𝑒⟩)
17 eqid 2736 . . . . . 6 (Edg‘⟨𝑣, 𝑒⟩) = (Edg‘⟨𝑣, 𝑒⟩)
18 eqid 2736 . . . . . 6 {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝} = {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}
19 eqid 2736 . . . . . 6 ⟨(𝑣 ∖ {𝑛}), ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝})⟩ = ⟨(𝑣 ∖ {𝑛}), ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝})⟩
2016, 17, 18, 19usgrres1 27912 . . . . 5 ((⟨𝑣, 𝑒⟩ ∈ USGraph ∧ 𝑛𝑣) → ⟨(𝑣 ∖ {𝑛}), ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝})⟩ ∈ USGraph)
21 eleq1 2824 . . . . . 6 (𝑓 = ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) → (𝑓 ∈ Fin ↔ ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) ∈ Fin))
2221adantl 482 . . . . 5 ((𝑤 = (𝑣 ∖ {𝑛}) ∧ 𝑓 = ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝})) → (𝑓 ∈ Fin ↔ ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) ∈ Fin))
2313, 14pm3.2i 471 . . . . . 6 (𝑣 ∈ V ∧ 𝑒 ∈ V)
24 fusgrfisbase 27925 . . . . . 6 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = 0) → 𝑒 ∈ Fin)
2523, 24mp3an1 1447 . . . . 5 ((⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = 0) → 𝑒 ∈ Fin)
26 simpl 483 . . . . . . . . 9 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣))) → (𝑣 ∈ V ∧ 𝑒 ∈ V))
27 simprr1 1220 . . . . . . . . . 10 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣))) → ⟨𝑣, 𝑒⟩ ∈ USGraph)
28 eleq1 2824 . . . . . . . . . . . . . 14 ((♯‘𝑣) = (𝑦 + 1) → ((♯‘𝑣) ∈ ℕ0 ↔ (𝑦 + 1) ∈ ℕ0))
29 hashclb 14165 . . . . . . . . . . . . . . . . 17 (𝑣 ∈ V → (𝑣 ∈ Fin ↔ (♯‘𝑣) ∈ ℕ0))
3029biimprd 247 . . . . . . . . . . . . . . . 16 (𝑣 ∈ V → ((♯‘𝑣) ∈ ℕ0𝑣 ∈ Fin))
3130adantr 481 . . . . . . . . . . . . . . 15 ((𝑣 ∈ V ∧ 𝑒 ∈ V) → ((♯‘𝑣) ∈ ℕ0𝑣 ∈ Fin))
3231com12 32 . . . . . . . . . . . . . 14 ((♯‘𝑣) ∈ ℕ0 → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin))
3328, 32syl6bir 253 . . . . . . . . . . . . 13 ((♯‘𝑣) = (𝑦 + 1) → ((𝑦 + 1) ∈ ℕ0 → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin)))
34333ad2ant2 1133 . . . . . . . . . . . 12 ((⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣) → ((𝑦 + 1) ∈ ℕ0 → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin)))
3534impcom 408 . . . . . . . . . . 11 (((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣)) → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin))
3635impcom 408 . . . . . . . . . 10 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣))) → 𝑣 ∈ Fin)
37 opfusgr 27920 . . . . . . . . . . 11 ((𝑣 ∈ V ∧ 𝑒 ∈ V) → (⟨𝑣, 𝑒⟩ ∈ FinUSGraph ↔ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ 𝑣 ∈ Fin)))
3837adantr 481 . . . . . . . . . 10 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣))) → (⟨𝑣, 𝑒⟩ ∈ FinUSGraph ↔ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ 𝑣 ∈ Fin)))
3927, 36, 38mpbir2and 710 . . . . . . . . 9 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣))) → ⟨𝑣, 𝑒⟩ ∈ FinUSGraph)
40 simprr3 1222 . . . . . . . . 9 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣))) → 𝑛𝑣)
4126, 39, 403jca 1127 . . . . . . . 8 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣))) → ((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ FinUSGraph ∧ 𝑛𝑣))
4223, 41mpan 687 . . . . . . 7 (((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣)) → ((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ FinUSGraph ∧ 𝑛𝑣))
43 fusgrfisstep 27926 . . . . . . 7 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ FinUSGraph ∧ 𝑛𝑣) → (( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) ∈ Fin → 𝑒 ∈ Fin))
4442, 43syl 17 . . . . . 6 (((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣)) → (( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) ∈ Fin → 𝑒 ∈ Fin))
4544imp 407 . . . . 5 ((((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛𝑣)) ∧ ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛𝑝}) ∈ Fin) → 𝑒 ∈ Fin)
464, 8, 10, 12, 20, 22, 25, 45opfi1ind 14308 . . . 4 ((⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → (iEdg‘𝐺) ∈ Fin)
473, 46sylan 580 . . 3 ((𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → (iEdg‘𝐺) ∈ Fin)
48 eqid 2736 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
49 eqid 2736 . . . . 5 (Edg‘𝐺) = (Edg‘𝐺)
5048, 49usgredgffibi 27921 . . . 4 (𝐺 ∈ USGraph → ((Edg‘𝐺) ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
5150adantr 481 . . 3 ((𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → ((Edg‘𝐺) ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
5247, 51mpbird 256 . 2 ((𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → (Edg‘𝐺) ∈ Fin)
532, 52sylbi 216 1 (𝐺 ∈ FinUSGraph → (Edg‘𝐺) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1540  wcel 2105  wnel 3046  {crab 3403  Vcvv 3441  cdif 3894  {csn 4572  cop 4578  cmpt 5172   I cid 5511  cres 5616  cfv 6473  (class class class)co 7329  Fincfn 8796  0cc0 10964  1c1 10965   + caddc 10967  0cn0 12326  chash 14137  Vtxcvtx 27596  iEdgciedg 27597  Edgcedg 27647  USGraphcusgr 27749  FinUSGraphcfusgr 27913
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-rep 5226  ax-sep 5240  ax-nul 5247  ax-pow 5305  ax-pr 5369  ax-un 7642  ax-cnex 11020  ax-resscn 11021  ax-1cn 11022  ax-icn 11023  ax-addcl 11024  ax-addrcl 11025  ax-mulcl 11026  ax-mulrcl 11027  ax-mulcom 11028  ax-addass 11029  ax-mulass 11030  ax-distr 11031  ax-i2m1 11032  ax-1ne0 11033  ax-1rid 11034  ax-rnegex 11035  ax-rrecex 11036  ax-cnre 11037  ax-pre-lttri 11038  ax-pre-lttrn 11039  ax-pre-ltadd 11040  ax-pre-mulgt0 11041
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3349  df-reu 3350  df-rab 3404  df-v 3443  df-sbc 3727  df-csb 3843  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3916  df-nul 4269  df-if 4473  df-pw 4548  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4852  df-int 4894  df-iun 4940  df-br 5090  df-opab 5152  df-mpt 5173  df-tr 5207  df-id 5512  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5569  df-we 5571  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6232  df-ord 6299  df-on 6300  df-lim 6301  df-suc 6302  df-iota 6425  df-fun 6475  df-fn 6476  df-f 6477  df-f1 6478  df-fo 6479  df-f1o 6480  df-fv 6481  df-riota 7286  df-ov 7332  df-oprab 7333  df-mpo 7334  df-om 7773  df-1st 7891  df-2nd 7892  df-frecs 8159  df-wrecs 8190  df-recs 8264  df-rdg 8303  df-1o 8359  df-2o 8360  df-oadd 8363  df-er 8561  df-en 8797  df-dom 8798  df-sdom 8799  df-fin 8800  df-dju 9750  df-card 9788  df-pnf 11104  df-mnf 11105  df-xr 11106  df-ltxr 11107  df-le 11108  df-sub 11300  df-neg 11301  df-nn 12067  df-2 12129  df-n0 12327  df-xnn0 12399  df-z 12413  df-uz 12676  df-fz 13333  df-hash 14138  df-vtx 27598  df-iedg 27599  df-edg 27648  df-uhgr 27658  df-upgr 27682  df-umgr 27683  df-uspgr 27750  df-usgr 27751  df-fusgr 27914
This theorem is referenced by:  fusgrfupgrfs  27928  nbfiusgrfi  27972  cusgrsizeindslem  28048  cusgrsizeinds  28049  sizusglecusglem2  28059  vtxdgfusgrf  28094  numclwwlk1  28954
  Copyright terms: Public domain W3C validator