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

Theorem isubgr3stgr 49406
Description: If a vertex of a simple graph has exactly 𝑁 (different) neighbors, and none of these neighbors are connected by an edge, then the (closed) neighborhood of this vertex induces a subgraph which is isomorphic to an 𝑁-star. (Contributed by AV, 29-Sep-2025.)
Hypotheses
Ref Expression
isubgr3stgr.v 𝑉 = (Vtx‘𝐺)
isubgr3stgr.u 𝑈 = (𝐺 NeighbVtx 𝑋)
isubgr3stgr.c 𝐶 = (𝐺 ClNeighbVtx 𝑋)
isubgr3stgr.n 𝑁 ∈ ℕ0
isubgr3stgr.s 𝑆 = (StarGr‘𝑁)
isubgr3stgr.w 𝑊 = (Vtx‘𝑆)
isubgr3stgr.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
isubgr3stgr ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → (((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸) → (𝐺 ISubGr 𝐶) ≃𝑔𝑟 (StarGr‘𝑁)))
Distinct variable groups:   𝑦,𝐶   𝑥,𝐸,𝑦   𝑦,𝐺   𝑥,𝑁,𝑦   𝑥,𝑈,𝑦   𝑦,𝑉   𝑦,𝑊   𝑦,𝑋
Allowed substitution hints:   𝐶(𝑥)   𝑆(𝑥, 𝑦)   𝐺(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑋(𝑥)

Proof of Theorem isubgr3stgr
Dummy variables 𝑓 𝑔 𝑒 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 488 . . . . 5 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → 𝐺 ∈ USGraph)
2 simpr 490 . . . . 5 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑉)
3 simpl 488 . . . . 5 (((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸) → (♯‘𝑈) = 𝑁)
4 isubgr3stgr.v . . . . . 6 𝑉 = (Vtx‘𝐺)
5 isubgr3stgr.u . . . . . 6 𝑈 = (𝐺 NeighbVtx 𝑋)
6 isubgr3stgr.c . . . . . 6 𝐶 = (𝐺 ClNeighbVtx 𝑋)
7 isubgr3stgr.n . . . . . 6 𝑁 ∈ ℕ0
8 isubgr3stgr.s . . . . . 6 𝑆 = (StarGr‘𝑁)
9 isubgr3stgr.w . . . . . 6 𝑊 = (Vtx‘𝑆)
104, 5, 6, 7, 8, 9isubgr3stgrlem3 49399 . . . . 5 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ (♯‘𝑈) = 𝑁) → ∃𝑓(𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0))
111, 2, 3, 10syl2an3an 1452 . . . 4 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → ∃𝑓(𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0))
124clnbgrssvtx 49262 . . . . . . . . . . . . . . . . 17 (𝐺 ClNeighbVtx 𝑋) ⊆ 𝑉
136, 12eqsstri 3958 . . . . . . . . . . . . . . . 16 𝐶 ⊆ 𝑉
1413a1i 11 . . . . . . . . . . . . . . 15 (𝑋 ∈ 𝑉 → 𝐶 ⊆ 𝑉)
1514anim2i 629 . . . . . . . . . . . . . 14 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → (𝐺 ∈ USGraph ∧ 𝐶 ⊆ 𝑉))
1615adantr 486 . . . . . . . . . . . . 13 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → (𝐺 ∈ USGraph ∧ 𝐶 ⊆ 𝑉))
174isubgrvtx 49298 . . . . . . . . . . . . 13 ((𝐺 ∈ USGraph ∧ 𝐶 ⊆ 𝑉) → (Vtx‘(𝐺 ISubGr 𝐶)) = 𝐶)
1816, 17syl 18 . . . . . . . . . . . 12 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → (Vtx‘(𝐺 ISubGr 𝐶)) = 𝐶)
1918eqcomd 2772 . . . . . . . . . . 11 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → 𝐶 = (Vtx‘(𝐺 ISubGr 𝐶)))
2019f1oeq2d 6849 . . . . . . . . . 10 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → (𝑓:𝐶⟶1-1onto𝑊 ↔ 𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊))
2120biimpd 232 . . . . . . . . 9 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → (𝑓:𝐶⟶1-1onto𝑊 → 𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊))
2221adantrd 497 . . . . . . . 8 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → ((𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0) → 𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊))
2322imp 412 . . . . . . 7 ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0)) → 𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊)
24 fvexd 6930 . . . . . . . . 9 ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0)) → (Edg‘(𝐺 ISubGr 𝐶)) ∈ V)
2524mptexd 7260 . . . . . . . 8 ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0)) → (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)) ∈ V)
26 isubgr3stgr.e . . . . . . . . 9 𝐸 = (Edg‘𝐺)
27 eqid 2766 . . . . . . . . 9 (Edg‘(𝐺 ISubGr 𝐶)) = (Edg‘(𝐺 ISubGr 𝐶))
28 eqid 2766 . . . . . . . . 9 (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)) = (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖))
294, 5, 6, 7, 8, 9, 26, 27, 28isubgr3stgrlem9 49405 . . . . . . . 8 ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0)) → ((𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)):(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = ((𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖))‘𝑒)))
30 f1oeq1 6841 . . . . . . . . 9 (𝑔 = (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)) → (𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ↔ (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)):(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁))))
31 fveq1 6914 . . . . . . . . . . 11 (𝑔 = (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)) → (𝑔‘𝑒) = ((𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖))‘𝑒))
3231eqeq2d 2777 . . . . . . . . . 10 (𝑔 = (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)) → ((𝑓 “ 𝑒) = (𝑔‘𝑒) ↔ (𝑓 “ 𝑒) = ((𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖))‘𝑒)))
3332ralbidv 3192 . . . . . . . . 9 (𝑔 = (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)) → (∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒) ↔ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = ((𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖))‘𝑒)))
3430, 33anbi12d 644 . . . . . . . 8 (𝑔 = (𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)) → ((𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒)) ↔ ((𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖)):(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = ((𝑖 ∈ (Edg‘(𝐺 ISubGr 𝐶)) ↦ (𝑓 “ 𝑖))‘𝑒))))
3525, 29, 34spcedv 3555 . . . . . . 7 ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0)) → ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒)))
3623, 35jca 521 . . . . . 6 ((((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) ∧ (𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0)) → (𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊 ∧ ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒))))
3736ex 418 . . . . 5 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → ((𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0) → (𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊 ∧ ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒)))))
3837eximdv 1954 . . . 4 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → (∃𝑓(𝑓:𝐶⟶1-1onto𝑊 ∧ (𝑓‘𝑋) = 0) → ∃𝑓(𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊 ∧ ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒)))))
3911, 38mpd 16 . . 3 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → ∃𝑓(𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊 ∧ ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒))))
404isubgrusgr 49303 . . . . . . 7 ((𝐺 ∈ USGraph ∧ 𝐶 ⊆ 𝑉) → (𝐺 ISubGr 𝐶) ∈ USGraph)
4115, 40syl 18 . . . . . 6 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → (𝐺 ISubGr 𝐶) ∈ USGraph)
42 usgruspgr 29820 . . . . . 6 ((𝐺 ISubGr 𝐶) ∈ USGraph → (𝐺 ISubGr 𝐶) ∈ USPGraph)
43 uspgrushgr 29817 . . . . . 6 ((𝐺 ISubGr 𝐶) ∈ USPGraph → (𝐺 ISubGr 𝐶) ∈ USHGraph)
4441, 42, 433syl 19 . . . . 5 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → (𝐺 ISubGr 𝐶) ∈ USHGraph)
45 stgrusgra 49390 . . . . . . 7 (𝑁 ∈ ℕ0 → (StarGr‘𝑁) ∈ USGraph)
46 usgruspgr 29820 . . . . . . 7 ((StarGr‘𝑁) ∈ USGraph → (StarGr‘𝑁) ∈ USPGraph)
47 uspgrushgr 29817 . . . . . . 7 ((StarGr‘𝑁) ∈ USPGraph → (StarGr‘𝑁) ∈ USHGraph)
4845, 46, 473syl 19 . . . . . 6 (𝑁 ∈ ℕ0 → (StarGr‘𝑁) ∈ USHGraph)
497, 48ax-mp 5 . . . . 5 (StarGr‘𝑁) ∈ USHGraph
50 eqid 2766 . . . . . 6 (Vtx‘(𝐺 ISubGr 𝐶)) = (Vtx‘(𝐺 ISubGr 𝐶))
518fveq2i 6918 . . . . . . 7 (Vtx‘𝑆) = (Vtx‘(StarGr‘𝑁))
529, 51eqtri 2789 . . . . . 6 𝑊 = (Vtx‘(StarGr‘𝑁))
53 eqid 2766 . . . . . 6 (Edg‘(StarGr‘𝑁)) = (Edg‘(StarGr‘𝑁))
5450, 52, 27, 53gricushgr 49348 . . . . 5 (((𝐺 ISubGr 𝐶) ∈ USHGraph ∧ (StarGr‘𝑁) ∈ USHGraph) → ((𝐺 ISubGr 𝐶) ≃𝑔𝑟 (StarGr‘𝑁) ↔ ∃𝑓(𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊 ∧ ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒)))))
5544, 49, 54sylancl 598 . . . 4 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → ((𝐺 ISubGr 𝐶) ≃𝑔𝑟 (StarGr‘𝑁) ↔ ∃𝑓(𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊 ∧ ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒)))))
5655adantr 486 . . 3 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → ((𝐺 ISubGr 𝐶) ≃𝑔𝑟 (StarGr‘𝑁) ↔ ∃𝑓(𝑓:(Vtx‘(𝐺 ISubGr 𝐶))⟶1-1onto𝑊 ∧ ∃𝑔(𝑔:(Edg‘(𝐺 ISubGr 𝐶))⟶1-1onto(Edg‘(StarGr‘𝑁)) ∧ ∀𝑒 ∈ (Edg‘(𝐺 ISubGr 𝐶))(𝑓 “ 𝑒) = (𝑔‘𝑒)))))
5739, 56mpbird 260 . 2 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) ∧ ((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)) → (𝐺 ISubGr 𝐶) ≃𝑔𝑟 (StarGr‘𝑁))
5857ex 418 1 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉) → (((♯‘𝑈) = 𝑁 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸) → (𝐺 ISubGr 𝐶) ≃𝑔𝑟 (StarGr‘𝑁)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150   ∉ wnel 3068  ∀wral 3083  Vcvv 3453   ⊆ wss 3899  {cpr 4589   class class class wbr 5107   ↦ cmpt 5191   “ cima 5660  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450  0cc0 11238  ℕ0cn0 12645  ♯chash 14514  Vtxcvtx 29633  Edgcedg 29684  USHGraphcushgr 29694  USPGraphcuspgr 29788  USGraphcusgr 29789   NeighbVtx cnbgr 29972   ClNeighbVtx cclnbgr 49249   ISubGr cisubgr 49291   ≃𝑔𝑟 cgric 49307  StarGrcstgr 49382
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-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-map 8886  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-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-xnn0 12719  df-z 12733  df-dec 12854  df-uz 13005  df-fz 13679  df-hash 14515  df-struct 17371  df-slot 17406  df-ndx 17418  df-base 17434  df-edgf 29626  df-vtx 29635  df-iedg 29636  df-edg 29685  df-uhgr 29695  df-ushgr 29696  df-upgr 29719  df-umgr 29720  df-uspgr 29790  df-usgr 29791  df-subgr 29908  df-nbgr 29973  df-clnbgr 49250  df-isubgr 49292  df-grim 49309  df-gric 49312  df-stgr 49383
This theorem is used by:  gpg5gricstgr3  49521
  Copyright terms: Public domain W3C validator