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

Theorem usgredgleordALT 27022
 Description: Alternate proof for usgredgleord 27021 based on usgriedgleord 27016. In a simple graph the number of edges which contain a given vertex is not greater than the number of vertices. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 18-Oct-2020.) (Proof shortened by AV, 5-May-2021.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
usgredgleord.v 𝑉 = (Vtx‘𝐺)
usgredgleord.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
usgredgleordALT ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (♯‘{𝑒𝐸𝑁𝑒}) ≤ (♯‘𝑉))
Distinct variable groups:   𝑒,𝐸   𝑒,𝑁
Allowed substitution hints:   𝐺(𝑒)   𝑉(𝑒)

Proof of Theorem usgredgleordALT
Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6665 . . . . . 6 (iEdg‘𝐺) ∈ V
21dmex 7602 . . . . 5 dom (iEdg‘𝐺) ∈ V
32rabex 5211 . . . 4 {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ∈ V
43a1i 11 . . 3 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ∈ V)
5 usgredgleord.e . . . 4 𝐸 = (Edg‘𝐺)
6 eqid 2822 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
7 usgredgleord.v . . . 4 𝑉 = (Vtx‘𝐺)
8 eqid 2822 . . . 4 {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}
9 eleq2w 2897 . . . . 5 (𝑒 = 𝑓 → (𝑁𝑒𝑁𝑓))
109cbvrabv 3467 . . . 4 {𝑒𝐸𝑁𝑒} = {𝑓𝐸𝑁𝑓}
11 eqid 2822 . . . 4 (𝑦 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ↦ ((iEdg‘𝐺)‘𝑦)) = (𝑦 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ↦ ((iEdg‘𝐺)‘𝑦))
125, 6, 7, 8, 10, 11usgredgedg 27018 . . 3 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (𝑦 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ↦ ((iEdg‘𝐺)‘𝑦)):{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}–1-1-onto→{𝑒𝐸𝑁𝑒})
134, 12hasheqf1od 13710 . 2 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}) = (♯‘{𝑒𝐸𝑁𝑒}))
147, 6usgriedgleord 27016 . 2 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}) ≤ (♯‘𝑉))
1513, 14eqbrtrrd 5066 1 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (♯‘{𝑒𝐸𝑁𝑒}) ≤ (♯‘𝑉))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2114  {crab 3134  Vcvv 3469   class class class wbr 5042   ↦ cmpt 5122  dom cdm 5532  ‘cfv 6334   ≤ cle 10665  ♯chash 13686  Vtxcvtx 26787  iEdgciedg 26788  Edgcedg 26838  USGraphcusgr 26940 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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-nel 3116  df-ral 3135  df-rex 3136  df-reu 3137  df-rmo 3138  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-tp 4544  df-op 4546  df-uni 4814  df-int 4852  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5437  df-eprel 5442  df-po 5451  df-so 5452  df-fr 5491  df-we 5493  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-pred 6126  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-f1 6339  df-fo 6340  df-f1o 6341  df-fv 6342  df-riota 7098  df-ov 7143  df-oprab 7144  df-mpo 7145  df-om 7566  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-1o 8089  df-2o 8090  df-oadd 8093  df-er 8276  df-en 8497  df-dom 8498  df-sdom 8499  df-fin 8500  df-dju 9318  df-card 9356  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-n0 11886  df-xnn0 11956  df-z 11970  df-uz 12232  df-fz 12886  df-hash 13687  df-edg 26839  df-uhgr 26849  df-ushgr 26850  df-umgr 26874  df-uspgr 26941  df-usgr 26942 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator