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

Theorem nb3grpr 30020
Description: The neighbors of a vertex in a simple graph with three elements are an unordered pair of the other vertices iff all vertices are connected with each other. (Contributed by Alexander van der Vekens, 18-Oct-2017.) (Revised by AV, 28-Oct-2020.)
Hypotheses
Ref Expression
nb3grpr.v 𝑉 = (Vtx‘𝐺)
nb3grpr.e 𝐸 = (Edg‘𝐺)
nb3grpr.g (𝜑 → 𝐺 ∈ USGraph)
nb3grpr.t (𝜑 → 𝑉 = {𝐴, 𝐵, 𝐶})
nb3grpr.s (𝜑 → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍))
nb3grpr.n (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶))
Assertion
Ref Expression
nb3grpr (𝜑 → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧}))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑦,𝐸   𝑥,𝐺,𝑦,𝑧   𝑥,𝑉,𝑦,𝑧   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑧)   𝐸(𝑥, 𝑧)   𝑋(𝑥, 𝑦, 𝑧)   𝑌(𝑥, 𝑦, 𝑧)   𝑍(𝑥, 𝑦, 𝑧)

Proof of Theorem nb3grpr
StepHypRef Expression
1 id 23 . . . . . 6 (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) → ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸))
2 prcom 4695 . . . . . . . . . 10 {𝐴, 𝐵} = {𝐵, 𝐴}
32eleq1i 2855 . . . . . . . . 9 ({𝐴, 𝐵} ∈ 𝐸 ↔ {𝐵, 𝐴} ∈ 𝐸)
4 prcom 4695 . . . . . . . . . 10 {𝐵, 𝐶} = {𝐶, 𝐵}
54eleq1i 2855 . . . . . . . . 9 ({𝐵, 𝐶} ∈ 𝐸 ↔ {𝐶, 𝐵} ∈ 𝐸)
6 prcom 4695 . . . . . . . . . 10 {𝐶, 𝐴} = {𝐴, 𝐶}
76eleq1i 2855 . . . . . . . . 9 ({𝐶, 𝐴} ∈ 𝐸 ↔ {𝐴, 𝐶} ∈ 𝐸)
83, 5, 73anbi123i 1173 . . . . . . . 8 (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ ({𝐵, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))
9 3anrot 1117 . . . . . . . 8 (({𝐴, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸) ↔ ({𝐵, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))
108, 9bitr4i 281 . . . . . . 7 (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ ({𝐴, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
1110a1i 11 . . . . . 6 (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ ({𝐴, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
121, 11biadanii 834 . . . . 5 (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ∧ ({𝐴, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
13 an6 1475 . . . . 5 ((({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ∧ ({𝐴, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) ↔ (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸) ∧ ({𝐵, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
1412, 13bitri 278 . . . 4 (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸) ∧ ({𝐵, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
1514a1i 11 . . 3 (𝜑 → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸) ∧ ({𝐵, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
16 nb3grpr.v . . . . 5 𝑉 = (Vtx‘𝐺)
17 nb3grpr.e . . . . 5 𝐸 = (Edg‘𝐺)
18 nb3grpr.g . . . . 5 (𝜑 → 𝐺 ∈ USGraph)
19 nb3grpr.t . . . . 5 (𝜑 → 𝑉 = {𝐴, 𝐵, 𝐶})
20 nb3grpr.s . . . . 5 (𝜑 → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍))
2116, 17, 18, 19, 20nb3grprlem1 30018 . . . 4 (𝜑 → ((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} ↔ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)))
22 tprot 4712 . . . . . 6 {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴}
2319, 22eqtrdi 2814 . . . . 5 (𝜑 → 𝑉 = {𝐵, 𝐶, 𝐴})
24 3anrot 1117 . . . . . 6 ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ↔ (𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋))
2520, 24sylib 221 . . . . 5 (𝜑 → (𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋))
2616, 17, 18, 23, 25nb3grprlem1 30018 . . . 4 (𝜑 → ((𝐺 NeighbVtx 𝐵) = {𝐶, 𝐴} ↔ ({𝐵, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸)))
27 tprot 4712 . . . . . 6 {𝐶, 𝐴, 𝐵} = {𝐴, 𝐵, 𝐶}
2819, 27eqtr4di 2816 . . . . 5 (𝜑 → 𝑉 = {𝐶, 𝐴, 𝐵})
29 3anrot 1117 . . . . . 6 ((𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ↔ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍))
3020, 29sylibr 237 . . . . 5 (𝜑 → (𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌))
3116, 17, 18, 28, 30nb3grprlem1 30018 . . . 4 (𝜑 → ((𝐺 NeighbVtx 𝐶) = {𝐴, 𝐵} ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
3221, 26, 313anbi123d 1465 . . 3 (𝜑 → (((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} ∧ (𝐺 NeighbVtx 𝐵) = {𝐶, 𝐴} ∧ (𝐺 NeighbVtx 𝐶) = {𝐴, 𝐵}) ↔ (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸) ∧ ({𝐵, 𝐶} ∈ 𝐸 ∧ {𝐵, 𝐴} ∈ 𝐸) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
33 nb3grpr.n . . . . 5 (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶))
3416, 17, 18, 19, 20, 33nb3grprlem2 30019 . . . 4 (𝜑 → ((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐴) = {𝑦, 𝑧}))
35 necom 3012 . . . . . . . 8 (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴)
36 necom 3012 . . . . . . . 8 (𝐴 ≠ 𝐶 ↔ 𝐶 ≠ 𝐴)
37 biid 264 . . . . . . . 8 (𝐵 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)
3835, 36, 373anbi123i 1173 . . . . . . 7 ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴 ∧ 𝐵 ≠ 𝐶))
39 3anrot 1117 . . . . . . 7 ((𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴) ↔ (𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴 ∧ 𝐵 ≠ 𝐶))
4038, 39bitr4i 281 . . . . . 6 ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴))
4133, 40sylib 221 . . . . 5 (𝜑 → (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴))
4216, 17, 18, 23, 25, 41nb3grprlem2 30019 . . . 4 (𝜑 → ((𝐺 NeighbVtx 𝐵) = {𝐶, 𝐴} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐵) = {𝑦, 𝑧}))
43 3anrot 1117 . . . . . . 7 ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐵))
44 necom 3012 . . . . . . . 8 (𝐵 ≠ 𝐶 ↔ 𝐶 ≠ 𝐵)
45 biid 264 . . . . . . . 8 (𝐴 ≠ 𝐵 ↔ 𝐴 ≠ 𝐵)
4636, 44, 453anbi123i 1173 . . . . . . 7 ((𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐵) ↔ (𝐶 ≠ 𝐴 ∧ 𝐶 ≠ 𝐵 ∧ 𝐴 ≠ 𝐵))
4743, 46bitri 278 . . . . . 6 ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐶 ≠ 𝐴 ∧ 𝐶 ≠ 𝐵 ∧ 𝐴 ≠ 𝐵))
4833, 47sylib 221 . . . . 5 (𝜑 → (𝐶 ≠ 𝐴 ∧ 𝐶 ≠ 𝐵 ∧ 𝐴 ≠ 𝐵))
4916, 17, 18, 28, 30, 48nb3grprlem2 30019 . . . 4 (𝜑 → ((𝐺 NeighbVtx 𝐶) = {𝐴, 𝐵} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐶) = {𝑦, 𝑧}))
5034, 42, 493anbi123d 1465 . . 3 (𝜑 → (((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} ∧ (𝐺 NeighbVtx 𝐵) = {𝐶, 𝐴} ∧ (𝐺 NeighbVtx 𝐶) = {𝐴, 𝐵}) ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐶) = {𝑦, 𝑧})))
5115, 32, 503bitr2d 310 . 2 (𝜑 → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐶) = {𝑦, 𝑧})))
52 oveq2 7459 . . . . . 6 (𝑥 = 𝐴 → (𝐺 NeighbVtx 𝑥) = (𝐺 NeighbVtx 𝐴))
5352eqeq1d 2765 . . . . 5 (𝑥 = 𝐴 → ((𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ (𝐺 NeighbVtx 𝐴) = {𝑦, 𝑧}))
54532rexbidv 3231 . . . 4 (𝑥 = 𝐴 → (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐴) = {𝑦, 𝑧}))
55 oveq2 7459 . . . . . 6 (𝑥 = 𝐵 → (𝐺 NeighbVtx 𝑥) = (𝐺 NeighbVtx 𝐵))
5655eqeq1d 2765 . . . . 5 (𝑥 = 𝐵 → ((𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ (𝐺 NeighbVtx 𝐵) = {𝑦, 𝑧}))
57562rexbidv 3231 . . . 4 (𝑥 = 𝐵 → (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐵) = {𝑦, 𝑧}))
58 oveq2 7459 . . . . . 6 (𝑥 = 𝐶 → (𝐺 NeighbVtx 𝑥) = (𝐺 NeighbVtx 𝐶))
5958eqeq1d 2765 . . . . 5 (𝑥 = 𝐶 → ((𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ (𝐺 NeighbVtx 𝐶) = {𝑦, 𝑧}))
60592rexbidv 3231 . . . 4 (𝑥 = 𝐶 → (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐶) = {𝑦, 𝑧}))
6154, 57, 60raltpg 4660 . . 3 ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐶) = {𝑦, 𝑧})))
6220, 61syl 18 . 2 (𝜑 → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝐶) = {𝑦, 𝑧})))
63 raleq 3320 . . . 4 (𝑉 = {𝐴, 𝐵, 𝐶} → (∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ ∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧}))
6463bicomd 226 . . 3 (𝑉 = {𝐴, 𝐵, 𝐶} → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧}))
6519, 64syl 18 . 2 (𝜑 → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧} ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧}))
6651, 62, 653bitr2d 310 1 (𝜑 → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸 ∧ {𝐶, 𝐴} ∈ 𝐸) ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(𝐺 NeighbVtx 𝑥) = {𝑦, 𝑧}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ∖ cdif 4048  {csn 4588  {cpr 4590  {ctp 4592  ‘cfv 6566  (class class class)co 7451  Vtxcvtx 29631  Edgcedg 29682  USGraphcusgr 29787   NeighbVtx cnbgr 29970
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-n0 12647  df-xnn0 12720  df-z 12734  df-uz 13006  df-fz 13680  df-hash 14516  df-edg 29683  df-upgr 29717  df-umgr 29718  df-usgr 29789  df-nbgr 29971
This theorem is used by:  cusgr3vnbpr  30074
  Copyright terms: Public domain W3C validator