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

Theorem pgnbgreunbgr 48601
Description: In a Petersen graph, two different neighbors of a vertex have exactly one common neighbor, which is the vertex itself. (Contributed by AV, 9-Nov-2025.)
Hypotheses
Ref Expression
pgnbgreunbgr.g 𝐺 = (5 gPetersenGr 2)
pgnbgreunbgr.v 𝑉 = (Vtx‘𝐺)
pgnbgreunbgr.e 𝐸 = (Edg‘𝐺)
pgnbgreunbgr.n 𝑁 = (𝐺 NeighbVtx 𝑋)
Assertion
Ref Expression
pgnbgreunbgr ((𝐾𝑁𝐿𝑁𝐾𝐿) → ∃!𝑥𝑉 {{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸)
Distinct variable groups:   𝑥,𝐸   𝑥,𝐾   𝑥,𝐿   𝑥,𝑁   𝑥,𝑉   𝑥,𝑋
Allowed substitution hint:   𝐺(𝑥)

Proof of Theorem pgnbgreunbgr
Dummy variables 𝑦 𝑏 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 preq2 4678 . . . . . 6 (𝑥 = 𝑋 → {𝐾, 𝑥} = {𝐾, 𝑋})
2 preq1 4677 . . . . . 6 (𝑥 = 𝑋 → {𝑥, 𝐿} = {𝑋, 𝐿})
31, 2preq12d 4685 . . . . 5 (𝑥 = 𝑋 → {{𝐾, 𝑥}, {𝑥, 𝐿}} = {{𝐾, 𝑋}, {𝑋, 𝐿}})
43sseq1d 3953 . . . 4 (𝑥 = 𝑋 → ({{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸 ↔ {{𝐾, 𝑋}, {𝑋, 𝐿}} ⊆ 𝐸))
5 eqeq1 2740 . . . . . 6 (𝑥 = 𝑋 → (𝑥 = 𝑦𝑋 = 𝑦))
65imbi2d 340 . . . . 5 (𝑥 = 𝑋 → (({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑥 = 𝑦) ↔ ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑋 = 𝑦)))
76ralbidv 3160 . . . 4 (𝑥 = 𝑋 → (∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑥 = 𝑦) ↔ ∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑋 = 𝑦)))
84, 7anbi12d 633 . . 3 (𝑥 = 𝑋 → (({{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸 ∧ ∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑥 = 𝑦)) ↔ ({{𝐾, 𝑋}, {𝑋, 𝐿}} ⊆ 𝐸 ∧ ∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑋 = 𝑦))))
9 pgnbgreunbgr.n . . . . . . . . 9 𝑁 = (𝐺 NeighbVtx 𝑋)
109eleq2i 2828 . . . . . . . 8 (𝐾𝑁𝐾 ∈ (𝐺 NeighbVtx 𝑋))
1110biimpi 216 . . . . . . 7 (𝐾𝑁𝐾 ∈ (𝐺 NeighbVtx 𝑋))
12113ad2ant1 1134 . . . . . 6 ((𝐾𝑁𝐿𝑁𝐾𝐿) → 𝐾 ∈ (𝐺 NeighbVtx 𝑋))
13 pgnbgreunbgr.g . . . . . . . 8 𝐺 = (5 gPetersenGr 2)
14 pgjsgr 48568 . . . . . . . 8 (5 gPetersenGr 2) ∈ USGraph
1513, 14eqeltri 2832 . . . . . . 7 𝐺 ∈ USGraph
16 pgnbgreunbgr.e . . . . . . . 8 𝐸 = (Edg‘𝐺)
1716nbusgreledg 29422 . . . . . . 7 (𝐺 ∈ USGraph → (𝐾 ∈ (𝐺 NeighbVtx 𝑋) ↔ {𝐾, 𝑋} ∈ 𝐸))
1815, 17ax-mp 5 . . . . . 6 (𝐾 ∈ (𝐺 NeighbVtx 𝑋) ↔ {𝐾, 𝑋} ∈ 𝐸)
1912, 18sylib 218 . . . . 5 ((𝐾𝑁𝐿𝑁𝐾𝐿) → {𝐾, 𝑋} ∈ 𝐸)
20 usgrumgr 29250 . . . . . 6 (𝐺 ∈ USGraph → 𝐺 ∈ UMGraph)
2115, 20ax-mp 5 . . . . 5 𝐺 ∈ UMGraph
2219, 21jctil 519 . . . 4 ((𝐾𝑁𝐿𝑁𝐾𝐿) → (𝐺 ∈ UMGraph ∧ {𝐾, 𝑋} ∈ 𝐸))
23 pgnbgreunbgr.v . . . . 5 𝑉 = (Vtx‘𝐺)
2423, 16umgrpredgv 29209 . . . 4 ((𝐺 ∈ UMGraph ∧ {𝐾, 𝑋} ∈ 𝐸) → (𝐾𝑉𝑋𝑉))
25 simpr 484 . . . 4 ((𝐾𝑉𝑋𝑉) → 𝑋𝑉)
2622, 24, 253syl 18 . . 3 ((𝐾𝑁𝐿𝑁𝐾𝐿) → 𝑋𝑉)
279eleq2i 2828 . . . . . . . 8 (𝐿𝑁𝐿 ∈ (𝐺 NeighbVtx 𝑋))
2810, 27anbi12i 629 . . . . . . 7 ((𝐾𝑁𝐿𝑁) ↔ (𝐾 ∈ (𝐺 NeighbVtx 𝑋) ∧ 𝐿 ∈ (𝐺 NeighbVtx 𝑋)))
2916nbusgreledg 29422 . . . . . . . . . 10 (𝐺 ∈ USGraph → (𝐿 ∈ (𝐺 NeighbVtx 𝑋) ↔ {𝐿, 𝑋} ∈ 𝐸))
30 prcom 4676 . . . . . . . . . . 11 {𝐿, 𝑋} = {𝑋, 𝐿}
3130eleq1i 2827 . . . . . . . . . 10 ({𝐿, 𝑋} ∈ 𝐸 ↔ {𝑋, 𝐿} ∈ 𝐸)
3229, 31bitrdi 287 . . . . . . . . 9 (𝐺 ∈ USGraph → (𝐿 ∈ (𝐺 NeighbVtx 𝑋) ↔ {𝑋, 𝐿} ∈ 𝐸))
3317, 32anbi12d 633 . . . . . . . 8 (𝐺 ∈ USGraph → ((𝐾 ∈ (𝐺 NeighbVtx 𝑋) ∧ 𝐿 ∈ (𝐺 NeighbVtx 𝑋)) ↔ ({𝐾, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝐿} ∈ 𝐸)))
3415, 33ax-mp 5 . . . . . . 7 ((𝐾 ∈ (𝐺 NeighbVtx 𝑋) ∧ 𝐿 ∈ (𝐺 NeighbVtx 𝑋)) ↔ ({𝐾, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝐿} ∈ 𝐸))
3528, 34sylbb 219 . . . . . 6 ((𝐾𝑁𝐿𝑁) → ({𝐾, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝐿} ∈ 𝐸))
36353adant3 1133 . . . . 5 ((𝐾𝑁𝐿𝑁𝐾𝐿) → ({𝐾, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝐿} ∈ 𝐸))
37 prssi 4764 . . . . 5 (({𝐾, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝐿} ∈ 𝐸) → {{𝐾, 𝑋}, {𝑋, 𝐿}} ⊆ 𝐸)
3836, 37syl 17 . . . 4 ((𝐾𝑁𝐿𝑁𝐾𝐿) → {{𝐾, 𝑋}, {𝑋, 𝐿}} ⊆ 𝐸)
39 prex 5380 . . . . . . 7 {𝐾, 𝑦} ∈ V
40 prex 5380 . . . . . . 7 {𝑦, 𝐿} ∈ V
4139, 40prss 4763 . . . . . 6 (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) ↔ {{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸)
42 5eluz3 12833 . . . . . . . . . 10 5 ∈ (ℤ‘3)
43 pglem 48567 . . . . . . . . . 10 2 ∈ (1..^(⌈‘(5 / 2)))
44 eqid 2736 . . . . . . . . . . 11 (0..^5) = (0..^5)
45 eqid 2736 . . . . . . . . . . 11 (1..^(⌈‘(5 / 2))) = (1..^(⌈‘(5 / 2)))
4644, 45, 13, 23gpgvtxel 48523 . . . . . . . . . 10 ((5 ∈ (ℤ‘3) ∧ 2 ∈ (1..^(⌈‘(5 / 2)))) → (𝑦𝑉 ↔ ∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^5)𝑦 = ⟨𝑎, 𝑏⟩))
4742, 43, 46mp2an 693 . . . . . . . . 9 (𝑦𝑉 ↔ ∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^5)𝑦 = ⟨𝑎, 𝑏⟩)
4847biimpi 216 . . . . . . . 8 (𝑦𝑉 → ∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^5)𝑦 = ⟨𝑎, 𝑏⟩)
4948adantl 481 . . . . . . 7 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) → ∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^5)𝑦 = ⟨𝑎, 𝑏⟩)
50 opeq1 4816 . . . . . . . . . . . . . . . 16 (𝑎 = 0 → ⟨𝑎, 𝑏⟩ = ⟨0, 𝑏⟩)
5150eqeq2d 2747 . . . . . . . . . . . . . . 15 (𝑎 = 0 → (𝑦 = ⟨𝑎, 𝑏⟩ ↔ 𝑦 = ⟨0, 𝑏⟩))
5251adantr 480 . . . . . . . . . . . . . 14 ((𝑎 = 0 ∧ (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5))) → (𝑦 = ⟨𝑎, 𝑏⟩ ↔ 𝑦 = ⟨0, 𝑏⟩))
5313, 23, 16, 9pgnbgreunbgrlem3 48594 . . . . . . . . . . . . . . . . 17 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑏 ∈ (0..^5)) → (({𝐾, ⟨0, 𝑏⟩} ∈ 𝐸 ∧ {⟨0, 𝑏⟩, 𝐿} ∈ 𝐸) → 𝑋 = ⟨0, 𝑏⟩))
5453adantlr 716 . . . . . . . . . . . . . . . 16 ((((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5)) → (({𝐾, ⟨0, 𝑏⟩} ∈ 𝐸 ∧ {⟨0, 𝑏⟩, 𝐿} ∈ 𝐸) → 𝑋 = ⟨0, 𝑏⟩))
55 preq2 4678 . . . . . . . . . . . . . . . . . . 19 (𝑦 = ⟨0, 𝑏⟩ → {𝐾, 𝑦} = {𝐾, ⟨0, 𝑏⟩})
5655eleq1d 2821 . . . . . . . . . . . . . . . . . 18 (𝑦 = ⟨0, 𝑏⟩ → ({𝐾, 𝑦} ∈ 𝐸 ↔ {𝐾, ⟨0, 𝑏⟩} ∈ 𝐸))
57 preq1 4677 . . . . . . . . . . . . . . . . . . 19 (𝑦 = ⟨0, 𝑏⟩ → {𝑦, 𝐿} = {⟨0, 𝑏⟩, 𝐿})
5857eleq1d 2821 . . . . . . . . . . . . . . . . . 18 (𝑦 = ⟨0, 𝑏⟩ → ({𝑦, 𝐿} ∈ 𝐸 ↔ {⟨0, 𝑏⟩, 𝐿} ∈ 𝐸))
5956, 58anbi12d 633 . . . . . . . . . . . . . . . . 17 (𝑦 = ⟨0, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) ↔ ({𝐾, ⟨0, 𝑏⟩} ∈ 𝐸 ∧ {⟨0, 𝑏⟩, 𝐿} ∈ 𝐸)))
60 eqeq2 2748 . . . . . . . . . . . . . . . . 17 (𝑦 = ⟨0, 𝑏⟩ → (𝑋 = 𝑦𝑋 = ⟨0, 𝑏⟩))
6159, 60imbi12d 344 . . . . . . . . . . . . . . . 16 (𝑦 = ⟨0, 𝑏⟩ → ((({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦) ↔ (({𝐾, ⟨0, 𝑏⟩} ∈ 𝐸 ∧ {⟨0, 𝑏⟩, 𝐿} ∈ 𝐸) → 𝑋 = ⟨0, 𝑏⟩)))
6254, 61syl5ibrcom 247 . . . . . . . . . . . . . . 15 ((((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5)) → (𝑦 = ⟨0, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)))
6362adantl 481 . . . . . . . . . . . . . 14 ((𝑎 = 0 ∧ (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5))) → (𝑦 = ⟨0, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)))
6452, 63sylbid 240 . . . . . . . . . . . . 13 ((𝑎 = 0 ∧ (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5))) → (𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)))
6564ex 412 . . . . . . . . . . . 12 (𝑎 = 0 → ((((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5)) → (𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦))))
6613, 23, 16, 9pgnbgreunbgrlem6 48600 . . . . . . . . . . . . . . 15 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑏 ∈ (0..^5)) → (({𝐾, ⟨1, 𝑏⟩} ∈ 𝐸 ∧ {⟨1, 𝑏⟩, 𝐿} ∈ 𝐸) → 𝑋 = ⟨1, 𝑏⟩))
6766adantlr 716 . . . . . . . . . . . . . 14 ((((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5)) → (({𝐾, ⟨1, 𝑏⟩} ∈ 𝐸 ∧ {⟨1, 𝑏⟩, 𝐿} ∈ 𝐸) → 𝑋 = ⟨1, 𝑏⟩))
68 preq2 4678 . . . . . . . . . . . . . . . . 17 (𝑦 = ⟨1, 𝑏⟩ → {𝐾, 𝑦} = {𝐾, ⟨1, 𝑏⟩})
6968eleq1d 2821 . . . . . . . . . . . . . . . 16 (𝑦 = ⟨1, 𝑏⟩ → ({𝐾, 𝑦} ∈ 𝐸 ↔ {𝐾, ⟨1, 𝑏⟩} ∈ 𝐸))
70 preq1 4677 . . . . . . . . . . . . . . . . 17 (𝑦 = ⟨1, 𝑏⟩ → {𝑦, 𝐿} = {⟨1, 𝑏⟩, 𝐿})
7170eleq1d 2821 . . . . . . . . . . . . . . . 16 (𝑦 = ⟨1, 𝑏⟩ → ({𝑦, 𝐿} ∈ 𝐸 ↔ {⟨1, 𝑏⟩, 𝐿} ∈ 𝐸))
7269, 71anbi12d 633 . . . . . . . . . . . . . . 15 (𝑦 = ⟨1, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) ↔ ({𝐾, ⟨1, 𝑏⟩} ∈ 𝐸 ∧ {⟨1, 𝑏⟩, 𝐿} ∈ 𝐸)))
73 eqeq2 2748 . . . . . . . . . . . . . . 15 (𝑦 = ⟨1, 𝑏⟩ → (𝑋 = 𝑦𝑋 = ⟨1, 𝑏⟩))
7472, 73imbi12d 344 . . . . . . . . . . . . . 14 (𝑦 = ⟨1, 𝑏⟩ → ((({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦) ↔ (({𝐾, ⟨1, 𝑏⟩} ∈ 𝐸 ∧ {⟨1, 𝑏⟩, 𝐿} ∈ 𝐸) → 𝑋 = ⟨1, 𝑏⟩)))
7567, 74syl5ibrcom 247 . . . . . . . . . . . . 13 ((((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5)) → (𝑦 = ⟨1, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)))
76 opeq1 4816 . . . . . . . . . . . . . . 15 (𝑎 = 1 → ⟨𝑎, 𝑏⟩ = ⟨1, 𝑏⟩)
7776eqeq2d 2747 . . . . . . . . . . . . . 14 (𝑎 = 1 → (𝑦 = ⟨𝑎, 𝑏⟩ ↔ 𝑦 = ⟨1, 𝑏⟩))
7877imbi1d 341 . . . . . . . . . . . . 13 (𝑎 = 1 → ((𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)) ↔ (𝑦 = ⟨1, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦))))
7975, 78imbitrrid 246 . . . . . . . . . . . 12 (𝑎 = 1 → ((((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5)) → (𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦))))
8065, 79jaoi 858 . . . . . . . . . . 11 ((𝑎 = 0 ∨ 𝑎 = 1) → ((((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) ∧ 𝑏 ∈ (0..^5)) → (𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦))))
8180expd 415 . . . . . . . . . 10 ((𝑎 = 0 ∨ 𝑎 = 1) → (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) → (𝑏 ∈ (0..^5) → (𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)))))
82 elpri 4591 . . . . . . . . . 10 (𝑎 ∈ {0, 1} → (𝑎 = 0 ∨ 𝑎 = 1))
8381, 82syl11 33 . . . . . . . . 9 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) → (𝑎 ∈ {0, 1} → (𝑏 ∈ (0..^5) → (𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)))))
8483impd 410 . . . . . . . 8 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) → ((𝑎 ∈ {0, 1} ∧ 𝑏 ∈ (0..^5)) → (𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦))))
8584rexlimdvv 3193 . . . . . . 7 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) → (∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^5)𝑦 = ⟨𝑎, 𝑏⟩ → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦)))
8649, 85mpd 15 . . . . . 6 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) → (({𝐾, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐿} ∈ 𝐸) → 𝑋 = 𝑦))
8741, 86biimtrrid 243 . . . . 5 (((𝐾𝑁𝐿𝑁𝐾𝐿) ∧ 𝑦𝑉) → ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑋 = 𝑦))
8887ralrimiva 3129 . . . 4 ((𝐾𝑁𝐿𝑁𝐾𝐿) → ∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑋 = 𝑦))
8938, 88jca 511 . . 3 ((𝐾𝑁𝐿𝑁𝐾𝐿) → ({{𝐾, 𝑋}, {𝑋, 𝐿}} ⊆ 𝐸 ∧ ∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑋 = 𝑦)))
908, 26, 89rspcedvdw 3567 . 2 ((𝐾𝑁𝐿𝑁𝐾𝐿) → ∃𝑥𝑉 ({{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸 ∧ ∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑥 = 𝑦)))
91 preq2 4678 . . . . 5 (𝑥 = 𝑦 → {𝐾, 𝑥} = {𝐾, 𝑦})
92 preq1 4677 . . . . 5 (𝑥 = 𝑦 → {𝑥, 𝐿} = {𝑦, 𝐿})
9391, 92preq12d 4685 . . . 4 (𝑥 = 𝑦 → {{𝐾, 𝑥}, {𝑥, 𝐿}} = {{𝐾, 𝑦}, {𝑦, 𝐿}})
9493sseq1d 3953 . . 3 (𝑥 = 𝑦 → ({{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸 ↔ {{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸))
9594reu8 3679 . 2 (∃!𝑥𝑉 {{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸 ↔ ∃𝑥𝑉 ({{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸 ∧ ∀𝑦𝑉 ({{𝐾, 𝑦}, {𝑦, 𝐿}} ⊆ 𝐸𝑥 = 𝑦)))
9690, 95sylibr 234 1 ((𝐾𝑁𝐿𝑁𝐾𝐿) → ∃!𝑥𝑉 {{𝐾, 𝑥}, {𝑥, 𝐿}} ⊆ 𝐸)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848  w3a 1087   = wceq 1542  wcel 2114  wne 2932  wral 3051  wrex 3061  ∃!wreu 3340  wss 3889  {cpr 4569  cop 4573  cfv 6498  (class class class)co 7367  0cc0 11038  1c1 11039   / cdiv 11807  2c2 12236  3c3 12237  5c5 12239  cuz 12788  ..^cfzo 13608  cceil 13750  Vtxcvtx 29065  Edgcedg 29116  UMGraphcumgr 29150  USGraphcusgr 29218   NeighbVtx cnbgr 29401   gPetersenGr cgpg 48516
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-2o 8406  df-oadd 8409  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-sup 9355  df-inf 9356  df-dju 9825  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-2 12244  df-3 12245  df-4 12246  df-5 12247  df-6 12248  df-7 12249  df-8 12250  df-9 12251  df-n0 12438  df-xnn0 12511  df-z 12525  df-dec 12645  df-uz 12789  df-rp 12943  df-ico 13304  df-fz 13462  df-fzo 13609  df-fl 13751  df-ceil 13752  df-mod 13829  df-seq 13964  df-exp 14024  df-hash 14293  df-cj 15061  df-re 15062  df-im 15063  df-sqrt 15197  df-abs 15198  df-dvds 16222  df-struct 17117  df-slot 17152  df-ndx 17164  df-base 17180  df-edgf 29058  df-vtx 29067  df-iedg 29068  df-edg 29117  df-upgr 29151  df-umgr 29152  df-usgr 29220  df-nbgr 29402  df-gpg 48517
This theorem is referenced by:  pgn4cyclex  48602
  Copyright terms: Public domain W3C validator