rusgrpropnb - Metamath Proof Explorer

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

Theorem rusgrpropnb 27853

Description: The properties of a k-regular simple graph expressed with neighbors. (Contributed by Alexander van der Vekens, 26-Jul-2018.) (Revised by AV, 26-Dec-2020.)

**Hypothesis**
Ref	Expression
rusgrpropnb.v	⊢ 𝑉 = (Vtx‘𝐺)

**Assertion**
Ref	Expression
rusgrpropnb	⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 (♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾))

Distinct variable groups: 𝑣,𝐺 𝑣,𝐾 Allowed substitution hint: 𝑉(𝑣)

**Proof of Theorem rusgrpropnb**
Step	Hyp	Ref	Expression
1		rusgrpropnb.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		eqid 2738	. . 3 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺)
3	1, 2	rusgrprop0 27837	. 2 ⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾))
4		simp1 1134	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → 𝐺 ∈ USGraph)
5		simp2 1135	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → 𝐾 ∈ ℕ₀^*)
6	1	hashnbusgrvd 27798	. . . . . . 7 ⊢ ((𝐺 ∈ USGraph ∧ 𝑣 ∈ 𝑉) → (♯‘(𝐺 NeighbVtx 𝑣)) = ((VtxDeg‘𝐺)‘𝑣))
7	6	adantlr 711	. . . . . 6 ⊢ (((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^*) ∧ 𝑣 ∈ 𝑉) → (♯‘(𝐺 NeighbVtx 𝑣)) = ((VtxDeg‘𝐺)‘𝑣))
8		eqeq2 2750	. . . . . . 7 ⊢ (𝐾 = ((VtxDeg‘𝐺)‘𝑣) → ((♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾 ↔ (♯‘(𝐺 NeighbVtx 𝑣)) = ((VtxDeg‘𝐺)‘𝑣)))
9	8	eqcoms 2746	. . . . . 6 ⊢ (((VtxDeg‘𝐺)‘𝑣) = 𝐾 → ((♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾 ↔ (♯‘(𝐺 NeighbVtx 𝑣)) = ((VtxDeg‘𝐺)‘𝑣)))
10	7, 9	syl5ibrcom 246	. . . . 5 ⊢ (((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^*) ∧ 𝑣 ∈ 𝑉) → (((VtxDeg‘𝐺)‘𝑣) = 𝐾 → (♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾))
11	10	ralimdva 3102	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^*) → (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾 → ∀𝑣 ∈ 𝑉 (♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾))
12	11	3impia 1115	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → ∀𝑣 ∈ 𝑉 (♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾)
13	4, 5, 12	3jca 1126	. 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 (♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾))
14	3, 13	syl 17	1 ⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐾 ∈ ℕ₀^* ∧ ∀𝑣 ∈ 𝑉 (♯‘(𝐺 NeighbVtx 𝑣)) = 𝐾))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℕ₀^*cxnn0 12235 ♯chash 13972 Vtxcvtx 27269 USGraphcusgr 27422 NeighbVtx cnbgr 27602 VtxDegcvtxdg 27735 RegUSGraph crusgr 27826

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-oadd 8271 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-dju 9590 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-n0 12164 df-xnn0 12236 df-z 12250 df-uz 12512 df-xadd 12778 df-fz 13169 df-hash 13973 df-edg 27321 df-uhgr 27331 df-ushgr 27332 df-upgr 27355 df-umgr 27356 df-uspgr 27423 df-usgr 27424 df-nbgr 27603 df-vtxdg 27736 df-rgr 27827 df-rusgr 27828

This theorem is referenced by: rusgrpropedg 27854 rusgrpropadjvtx 27855 rusgr1vtx 27858 numclwwlk1 28626

W3C validator