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

Theorem frgrncvvdeq 30969
Description: In a friendship graph, two vertices which are not connected by an edge have the same degree. This corresponds to claim 1 in [Huneke] p. 1: "If x,y are elements of (the friendship graph) G and are not adjacent, then they have the same degree (i.e., the same number of adjacent vertices).". (Contributed by Alexander van der Vekens, 19-Dec-2017.) (Revised by AV, 10-May-2021.)
Hypotheses
Ref Expression
frgrncvvdeq.v 𝑉 = (Vtx‘𝐺)
frgrncvvdeq.d 𝐷 = (VtxDeg‘𝐺)
Assertion
Ref Expression
frgrncvvdeq (𝐺 ∈ FriendGraph → ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (𝐺 NeighbVtx 𝑥) → (𝐷‘𝑥) = (𝐷‘𝑦)))
Distinct variable groups:   𝑥,𝐺,𝑦   𝑥,𝑉,𝑦
Allowed substitution hints:   𝐷(𝑥, 𝑦)

Proof of Theorem frgrncvvdeq
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovexd 7485 . . . . . 6 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (𝐺 NeighbVtx 𝑥) ∈ V)
2 frgrncvvdeq.v . . . . . . 7 𝑉 = (Vtx‘𝐺)
3 eqid 2766 . . . . . . 7 (Edg‘𝐺) = (Edg‘𝐺)
4 eqid 2766 . . . . . . 7 (𝐺 NeighbVtx 𝑥) = (𝐺 NeighbVtx 𝑥)
5 eqid 2766 . . . . . . 7 (𝐺 NeighbVtx 𝑦) = (𝐺 NeighbVtx 𝑦)
6 simpl 488 . . . . . . . 8 ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → 𝑥 ∈ 𝑉)
76ad2antlr 740 . . . . . . 7 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → 𝑥 ∈ 𝑉)
8 eldifi 4069 . . . . . . . . 9 (𝑦 ∈ (𝑉 ∖ {𝑥}) → 𝑦 ∈ 𝑉)
98adantl 487 . . . . . . . 8 ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → 𝑦 ∈ 𝑉)
109ad2antlr 740 . . . . . . 7 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → 𝑦 ∈ 𝑉)
11 eldif 4051 . . . . . . . . . 10 (𝑦 ∈ (𝑉 ∖ {𝑥}) ↔ (𝑦 ∈ 𝑉 ∧ ¬ 𝑦 ∈ {𝑥}))
12 velsn 4599 . . . . . . . . . . . . 13 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
1312biimpri 231 . . . . . . . . . . . 12 (𝑦 = 𝑥 → 𝑦 ∈ {𝑥})
1413equcoms 2057 . . . . . . . . . . 11 (𝑥 = 𝑦 → 𝑦 ∈ {𝑥})
1514necon3bi 2988 . . . . . . . . . 10 (¬ 𝑦 ∈ {𝑥} → 𝑥 ≠ 𝑦)
1611, 15simplbiim 514 . . . . . . . . 9 (𝑦 ∈ (𝑉 ∖ {𝑥}) → 𝑥 ≠ 𝑦)
1716adantl 487 . . . . . . . 8 ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → 𝑥 ≠ 𝑦)
1817ad2antlr 740 . . . . . . 7 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → 𝑥 ≠ 𝑦)
19 simpr 490 . . . . . . 7 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → 𝑦 ∉ (𝐺 NeighbVtx 𝑥))
20 simpl 488 . . . . . . . 8 ((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) → 𝐺 ∈ FriendGraph )
2120adantr 486 . . . . . . 7 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → 𝐺 ∈ FriendGraph )
22 eqid 2766 . . . . . . 7 (𝑎 ∈ (𝐺 NeighbVtx 𝑥) ↦ (℩𝑏 ∈ (𝐺 NeighbVtx 𝑦){𝑎, 𝑏} ∈ (Edg‘𝐺))) = (𝑎 ∈ (𝐺 NeighbVtx 𝑥) ↦ (℩𝑏 ∈ (𝐺 NeighbVtx 𝑦){𝑎, 𝑏} ∈ (Edg‘𝐺)))
232, 3, 4, 5, 7, 10, 18, 19, 21, 22frgrncvvdeqlem10 30968 . . . . . 6 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (𝑎 ∈ (𝐺 NeighbVtx 𝑥) ↦ (℩𝑏 ∈ (𝐺 NeighbVtx 𝑦){𝑎, 𝑏} ∈ (Edg‘𝐺))):(𝐺 NeighbVtx 𝑥)⟶1-1onto(𝐺 NeighbVtx 𝑦))
241, 23hasheqf1od 14537 . . . . 5 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (♯‘(𝐺 NeighbVtx 𝑥)) = (♯‘(𝐺 NeighbVtx 𝑦)))
25 frgrusgr 30921 . . . . . . . 8 (𝐺 ∈ FriendGraph → 𝐺 ∈ USGraph)
2625, 6anim12i 625 . . . . . . 7 ((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) → (𝐺 ∈ USGraph ∧ 𝑥 ∈ 𝑉))
2726adantr 486 . . . . . 6 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (𝐺 ∈ USGraph ∧ 𝑥 ∈ 𝑉))
282hashnbusgrvd 30168 . . . . . 6 ((𝐺 ∈ USGraph ∧ 𝑥 ∈ 𝑉) → (♯‘(𝐺 NeighbVtx 𝑥)) = ((VtxDeg‘𝐺)‘𝑥))
2927, 28syl 18 . . . . 5 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (♯‘(𝐺 NeighbVtx 𝑥)) = ((VtxDeg‘𝐺)‘𝑥))
3025, 9anim12i 625 . . . . . . 7 ((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) → (𝐺 ∈ USGraph ∧ 𝑦 ∈ 𝑉))
3130adantr 486 . . . . . 6 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (𝐺 ∈ USGraph ∧ 𝑦 ∈ 𝑉))
322hashnbusgrvd 30168 . . . . . 6 ((𝐺 ∈ USGraph ∧ 𝑦 ∈ 𝑉) → (♯‘(𝐺 NeighbVtx 𝑦)) = ((VtxDeg‘𝐺)‘𝑦))
3331, 32syl 18 . . . . 5 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (♯‘(𝐺 NeighbVtx 𝑦)) = ((VtxDeg‘𝐺)‘𝑦))
3424, 29, 333eqtr3d 2809 . . . 4 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → ((VtxDeg‘𝐺)‘𝑥) = ((VtxDeg‘𝐺)‘𝑦))
35 frgrncvvdeq.d . . . . 5 𝐷 = (VtxDeg‘𝐺)
3635fveq1i 6916 . . . 4 (𝐷‘𝑥) = ((VtxDeg‘𝐺)‘𝑥)
3735fveq1i 6916 . . . 4 (𝐷‘𝑦) = ((VtxDeg‘𝐺)‘𝑦)
3834, 36, 373eqtr4g 2826 . . 3 (((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) ∧ 𝑦 ∉ (𝐺 NeighbVtx 𝑥)) → (𝐷‘𝑥) = (𝐷‘𝑦))
3938ex 418 . 2 ((𝐺 ∈ FriendGraph ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ (𝑉 ∖ {𝑥}))) → (𝑦 ∉ (𝐺 NeighbVtx 𝑥) → (𝐷‘𝑥) = (𝐷‘𝑦)))
4039ralrimivva 3212 1 (𝐺 ∈ FriendGraph → ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (𝐺 NeighbVtx 𝑥) → (𝐷‘𝑥) = (𝐷‘𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ≠ wne 2962   ∉ wnel 3068  ∀wral 3083  Vcvv 3453   ∖ cdif 4047  {csn 4587  {cpr 4589   ↦ cmpt 5191  ‘cfv 6565  ℩crio 7406  (class class class)co 7450  ♯chash 14514  Vtxcvtx 29633  Edgcedg 29684  USGraphcusgr 29789   NeighbVtx cnbgr 29972  VtxDegcvtxdg 30105   FriendGraph cfrgr 30918
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-oadd 8517  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-dju 10018  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-n0 12646  df-xnn0 12719  df-z 12733  df-uz 13005  df-xadd 13281  df-fz 13679  df-hash 14515  df-edg 29685  df-uhgr 29695  df-ushgr 29696  df-upgr 29719  df-umgr 29720  df-uspgr 29790  df-usgr 29791  df-nbgr 29973  df-vtxdg 30106  df-frgr 30919
This theorem is used by:  frgrwopreglem4a  30970
  Copyright terms: Public domain W3C validator