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

Theorem fusgrfis 29968
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 2763 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
21isfusgr 29956 . 2 (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin))
3 usgrop 29801 . . . 4 (𝐺 ∈ USGraph → ⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ USGraph)
4 fvex 6929 . . . . 5 (iEdg‘𝐺) ∈ V
5 mptresid 6061 . . . . . 6 ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) = (𝑞 ∈ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝} ↦ 𝑞)
6 fvex 6929 . . . . . . 7 (Edg‘⟨𝑣, 𝑒⟩) ∈ V
76mptrabex 7262 . . . . . 6 (𝑞 ∈ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝} ↦ 𝑞) ∈ V
85, 7eqeltri 2860 . . . . 5 ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) ∈ V
9 eleq1 2852 . . . . . 6 (𝑒 = (iEdg‘𝐺) → (𝑒 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
109adantl 487 . . . . 5 ((𝑣 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → (𝑒 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
11 eleq1 2852 . . . . . 6 (𝑒 = 𝑓 → (𝑒 ∈ Fin ↔ 𝑓 ∈ Fin))
1211adantl 487 . . . . 5 ((𝑣 = 𝑤 ∧ 𝑒 = 𝑓) → (𝑒 ∈ Fin ↔ 𝑓 ∈ Fin))
13 vex 3458 . . . . . . . 8 𝑣 ∈ V
14 vex 3458 . . . . . . . 8 𝑒 ∈ V
1513, 14opvtxfvi 29644 . . . . . . 7 (Vtx‘⟨𝑣, 𝑒⟩) = 𝑣
1615eqcomi 2772 . . . . . 6 𝑣 = (Vtx‘⟨𝑣, 𝑒⟩)
17 eqid 2763 . . . . . 6 (Edg‘⟨𝑣, 𝑒⟩) = (Edg‘⟨𝑣, 𝑒⟩)
18 eqid 2763 . . . . . 6 {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝} = {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}
19 eqid 2763 . . . . . 6 ⟨(𝑣 ∖ {𝑛}), ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝})⟩ = ⟨(𝑣 ∖ {𝑛}), ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝})⟩
2016, 17, 18, 19usgrres1 29953 . . . . 5 ((⟨𝑣, 𝑒⟩ ∈ USGraph ∧ 𝑛 ∈ 𝑣) → ⟨(𝑣 ∖ {𝑛}), ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝})⟩ ∈ USGraph)
21 eleq1 2852 . . . . . 6 (𝑓 = ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) → (𝑓 ∈ Fin ↔ ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) ∈ Fin))
2221adantl 487 . . . . 5 ((𝑤 = (𝑣 ∖ {𝑛}) ∧ 𝑓 = ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝})) → (𝑓 ∈ Fin ↔ ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) ∈ Fin))
2313, 14pm3.2i 476 . . . . . 6 (𝑣 ∈ V ∧ 𝑒 ∈ V)
24 fusgrfisbase 29966 . . . . . 6 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = 0) → 𝑒 ∈ Fin)
2523, 24mp3an1 1478 . . . . 5 ((⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = 0) → 𝑒 ∈ Fin)
26 simpl 488 . . . . . . . . 9 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))) → (𝑣 ∈ V ∧ 𝑒 ∈ V))
27 simprr1 1240 . . . . . . . . . 10 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))) → ⟨𝑣, 𝑒⟩ ∈ USGraph)
28 eleq1 2852 . . . . . . . . . . . . . 14 ((♯‘𝑣) = (𝑦 + 1) → ((♯‘𝑣) ∈ ℕ0 ↔ (𝑦 + 1) ∈ ℕ0))
29 hashclb 14543 . . . . . . . . . . . . . . . . 17 (𝑣 ∈ V → (𝑣 ∈ Fin ↔ (♯‘𝑣) ∈ ℕ0))
3029biimprd 251 . . . . . . . . . . . . . . . 16 (𝑣 ∈ V → ((♯‘𝑣) ∈ ℕ0 → 𝑣 ∈ Fin))
3130adantr 486 . . . . . . . . . . . . . . 15 ((𝑣 ∈ V ∧ 𝑒 ∈ V) → ((♯‘𝑣) ∈ ℕ0 → 𝑣 ∈ Fin))
3231com12 33 . . . . . . . . . . . . . 14 ((♯‘𝑣) ∈ ℕ0 → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin))
3328, 32biimtrrdi 257 . . . . . . . . . . . . 13 ((♯‘𝑣) = (𝑦 + 1) → ((𝑦 + 1) ∈ ℕ0 → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin)))
34333ad2ant2 1152 . . . . . . . . . . . 12 ((⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣) → ((𝑦 + 1) ∈ ℕ0 → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin)))
3534impcom 413 . . . . . . . . . . 11 (((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) → ((𝑣 ∈ V ∧ 𝑒 ∈ V) → 𝑣 ∈ Fin))
3635impcom 413 . . . . . . . . . 10 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))) → 𝑣 ∈ Fin)
37 opfusgr 29961 . . . . . . . . . . 11 ((𝑣 ∈ V ∧ 𝑒 ∈ V) → (⟨𝑣, 𝑒⟩ ∈ FinUSGraph ↔ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ 𝑣 ∈ Fin)))
3837adantr 486 . . . . . . . . . 10 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))) → (⟨𝑣, 𝑒⟩ ∈ FinUSGraph ↔ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ 𝑣 ∈ Fin)))
3927, 36, 38mpbir2and 726 . . . . . . . . 9 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))) → ⟨𝑣, 𝑒⟩ ∈ FinUSGraph)
40 simprr3 1242 . . . . . . . . 9 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))) → 𝑛 ∈ 𝑣)
4126, 39, 403jca 1146 . . . . . . . 8 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))) → ((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ FinUSGraph ∧ 𝑛 ∈ 𝑣))
4223, 41mpan 703 . . . . . . 7 (((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) → ((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ FinUSGraph ∧ 𝑛 ∈ 𝑣))
43 fusgrfisstep 29967 . . . . . . 7 (((𝑣 ∈ V ∧ 𝑒 ∈ V) ∧ ⟨𝑣, 𝑒⟩ ∈ FinUSGraph ∧ 𝑛 ∈ 𝑣) → (( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) ∈ Fin → 𝑒 ∈ Fin))
4442, 43syl 18 . . . . . 6 (((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) → (( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) ∈ Fin → 𝑒 ∈ Fin))
4544imp 412 . . . . 5 ((((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ USGraph ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) ∧ ( I ↾ {𝑝 ∈ (Edg‘⟨𝑣, 𝑒⟩) ∣ 𝑛 ∉ 𝑝}) ∈ Fin) → 𝑒 ∈ Fin)
464, 8, 10, 12, 20, 22, 25, 45opfi1ind 14698 . . . 4 ((⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → (iEdg‘𝐺) ∈ Fin)
473, 46sylan 592 . . 3 ((𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → (iEdg‘𝐺) ∈ Fin)
48 eqid 2763 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
49 eqid 2763 . . . . 5 (Edg‘𝐺) = (Edg‘𝐺)
5048, 49usgredgffibi 29962 . . . 4 (𝐺 ∈ USGraph → ((Edg‘𝐺) ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
5150adantr 486 . . 3 ((𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → ((Edg‘𝐺) ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
5247, 51mpbird 260 . 2 ((𝐺 ∈ USGraph ∧ (Vtx‘𝐺) ∈ Fin) → (Edg‘𝐺) ∈ Fin)
532, 52sylbi 220 1 (𝐺 ∈ FinUSGraph → (Edg‘𝐺) ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ∉ wnel 3065  {crab 3416  Vcvv 3454   ∖ cdif 4048  {csn 4588  ⟨cop 4840   ↦ cmpt 5192   I cid 5552   ↾ cres 5660  ‘cfv 6566  (class class class)co 7451  Fincfn 9011  0cc0 11239  1c1 11240   + caddc 11242  ℕ0cn0 12646  ♯chash 14515  Vtxcvtx 29631  iEdgciedg 29632  Edgcedg 29682  USGraphcusgr 29787  FinUSGraphcfusgr 29954
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-n0 12647  df-xnn0 12720  df-z 12734  df-uz 13006  df-fz 13680  df-hash 14516  df-vtx 29633  df-iedg 29634  df-edg 29683  df-uhgr 29693  df-upgr 29717  df-umgr 29718  df-uspgr 29788  df-usgr 29789  df-fusgr 29955
This theorem is used by:  fusgrfupgrfs  29969  nbfiusgrfi  30013  cusgrsizeindslem  30089  cusgrsizeinds  30090  sizusglecusglem2  30100  vtxdgfusgrf  30135  numclwwlk1  31019  clnbfiusgrfi  49215
  Copyright terms: Public domain W3C validator