Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  usgredgaleordALT Structured version   Visualization version   GIF version

Theorem usgredgaleordALT 40461
 Description: 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.) TODO-AV: proof can be shortened by using "bj-eleq2w", after it is moved to main.set.
Hypotheses
Ref Expression
usgredgaleord.v 𝑉 = (Vtx‘𝐺)
usgredgaleord.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
usgredgaleordALT ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (#‘{𝑒𝐸𝑁𝑒}) ≤ (#‘𝑉))
Distinct variable groups:   𝑒,𝐸   𝑒,𝑁
Allowed substitution hints:   𝐺(𝑒)   𝑉(𝑒)

Proof of Theorem usgredgaleordALT
Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6113 . . . . . 6 (iEdg‘𝐺) ∈ V
21dmex 6991 . . . . 5 dom (iEdg‘𝐺) ∈ V
32rabex 4740 . . . 4 {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ∈ V
43a1i 11 . . 3 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ∈ V)
5 usgredgaleord.e . . . 4 𝐸 = (Edg‘𝐺)
6 eqid 2610 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
7 usgredgaleord.v . . . 4 𝑉 = (Vtx‘𝐺)
8 eqid 2610 . . . 4 {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}
9 eleq2 2677 . . . . 5 (𝑒 = 𝑓 → (𝑁𝑒𝑁𝑓))
109cbvrabv 3172 . . . 4 {𝑒𝐸𝑁𝑒} = {𝑓𝐸𝑁𝑓}
11 eqid 2610 . . . 4 (𝑦 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ↦ ((iEdg‘𝐺)‘𝑦)) = (𝑦 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ↦ ((iEdg‘𝐺)‘𝑦))
125, 6, 7, 8, 10, 11usgredgedga 40457 . . 3 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (𝑦 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)} ↦ ((iEdg‘𝐺)‘𝑦)):{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}–1-1-onto→{𝑒𝐸𝑁𝑒})
134, 12hasheqf1od 13006 . 2 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (#‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}) = (#‘{𝑒𝐸𝑁𝑒}))
147, 6usgredgleord 40455 . 2 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (#‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑁 ∈ ((iEdg‘𝐺)‘𝑥)}) ≤ (#‘𝑉))
1513, 14eqbrtrrd 4607 1 ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (#‘{𝑒𝐸𝑁𝑒}) ≤ (#‘𝑉))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {crab 2900  Vcvv 3173   class class class wbr 4583   ↦ cmpt 4643  dom cdm 5038  ‘cfv 5804   ≤ cle 9954  #chash 12979  Vtxcvtx 25673  iEdgciedg 25674  Edgcedga 25792   USGraph cusgr 40379 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-fz 12198  df-hash 12980  df-uhgr 25724  df-ushgr 25725  df-umgr 25750  df-edga 25793  df-uspgr 40380  df-usgr 40381 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator