Theorem nb3grprlem1 28328

Description: Lemma 1 for nb3grpr 28330. (Contributed by Alexander van der Vekens, 15-Oct-2017.) (Revised by AV, 28-Oct-2020.)

Hypotheses

Ref	Expression
nb3grpr.v	⊢ 𝑉 = (Vtx‘𝐺)
nb3grpr.e	⊢ 𝐸 = (Edg‘𝐺)
nb3grpr.g	⊢ (𝜑 → 𝐺 ∈ USGraph)
nb3grpr.t	⊢ (𝜑 → 𝑉 = {𝐴, 𝐵, 𝐶})
nb3grpr.s	⊢ (𝜑 → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍))

Assertion

Ref	Expression
nb3grprlem1	⊢ (𝜑 → ((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} ↔ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)))

Proof of Theorem nb3grprlem1

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nb3grpr.s	. . . . . . 7 ⊢ (𝜑 → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍))
2		prid1g 4721	. . . . . . . 8 ⊢ (𝐵 ∈ 𝑌 → 𝐵 ∈ {𝐵, 𝐶})
3	2	3ad2ant2 1134	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 𝐵 ∈ {𝐵, 𝐶})
4	1, 3	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ {𝐵, 𝐶})
5	4	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → 𝐵 ∈ {𝐵, 𝐶})
6		eleq2 2826	. . . . . . 7 ⊢ ({𝐵, 𝐶} = (𝐺 NeighbVtx 𝐴) → (𝐵 ∈ {𝐵, 𝐶} ↔ 𝐵 ∈ (𝐺 NeighbVtx 𝐴)))
7	6	eqcoms 2744	. . . . . 6 ⊢ ((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} → (𝐵 ∈ {𝐵, 𝐶} ↔ 𝐵 ∈ (𝐺 NeighbVtx 𝐴)))
8	7	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → (𝐵 ∈ {𝐵, 𝐶} ↔ 𝐵 ∈ (𝐺 NeighbVtx 𝐴)))
9	5, 8	mpbid 231	. . . 4 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → 𝐵 ∈ (𝐺 NeighbVtx 𝐴))
10		nb3grpr.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ USGraph)
11		nb3grpr.e	. . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺)
12	11	nbusgreledg 28301	. . . . . . 7 ⊢ (𝐺 ∈ USGraph → (𝐵 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐵, 𝐴} ∈ 𝐸))
13		prcom 4693	. . . . . . . . 9 ⊢ {𝐵, 𝐴} = {𝐴, 𝐵}
14	13	a1i 11	. . . . . . . 8 ⊢ (𝐺 ∈ USGraph → {𝐵, 𝐴} = {𝐴, 𝐵})
15	14	eleq1d 2822	. . . . . . 7 ⊢ (𝐺 ∈ USGraph → ({𝐵, 𝐴} ∈ 𝐸 ↔ {𝐴, 𝐵} ∈ 𝐸))
16	12, 15	bitrd 278	. . . . . 6 ⊢ (𝐺 ∈ USGraph → (𝐵 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐴, 𝐵} ∈ 𝐸))
17	10, 16	syl 17	. . . . 5 ⊢ (𝜑 → (𝐵 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐴, 𝐵} ∈ 𝐸))
18	17	adantr 481	. . . 4 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → (𝐵 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐴, 𝐵} ∈ 𝐸))
19	9, 18	mpbid 231	. . 3 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → {𝐴, 𝐵} ∈ 𝐸)
20		prid2g 4722	. . . . . . . 8 ⊢ (𝐶 ∈ 𝑍 → 𝐶 ∈ {𝐵, 𝐶})
21	20	3ad2ant3 1135	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 𝐶 ∈ {𝐵, 𝐶})
22	1, 21	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ {𝐵, 𝐶})
23	22	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → 𝐶 ∈ {𝐵, 𝐶})
24		eleq2 2826	. . . . . . 7 ⊢ ({𝐵, 𝐶} = (𝐺 NeighbVtx 𝐴) → (𝐶 ∈ {𝐵, 𝐶} ↔ 𝐶 ∈ (𝐺 NeighbVtx 𝐴)))
25	24	eqcoms 2744	. . . . . 6 ⊢ ((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} → (𝐶 ∈ {𝐵, 𝐶} ↔ 𝐶 ∈ (𝐺 NeighbVtx 𝐴)))
26	25	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → (𝐶 ∈ {𝐵, 𝐶} ↔ 𝐶 ∈ (𝐺 NeighbVtx 𝐴)))
27	23, 26	mpbid 231	. . . 4 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → 𝐶 ∈ (𝐺 NeighbVtx 𝐴))
28	11	nbusgreledg 28301	. . . . . . 7 ⊢ (𝐺 ∈ USGraph → (𝐶 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐶, 𝐴} ∈ 𝐸))
29		prcom 4693	. . . . . . . . 9 ⊢ {𝐶, 𝐴} = {𝐴, 𝐶}
30	29	a1i 11	. . . . . . . 8 ⊢ (𝐺 ∈ USGraph → {𝐶, 𝐴} = {𝐴, 𝐶})
31	30	eleq1d 2822	. . . . . . 7 ⊢ (𝐺 ∈ USGraph → ({𝐶, 𝐴} ∈ 𝐸 ↔ {𝐴, 𝐶} ∈ 𝐸))
32	28, 31	bitrd 278	. . . . . 6 ⊢ (𝐺 ∈ USGraph → (𝐶 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐴, 𝐶} ∈ 𝐸))
33	10, 32	syl 17	. . . . 5 ⊢ (𝜑 → (𝐶 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐴, 𝐶} ∈ 𝐸))
34	33	adantr 481	. . . 4 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → (𝐶 ∈ (𝐺 NeighbVtx 𝐴) ↔ {𝐴, 𝐶} ∈ 𝐸))
35	27, 34	mpbid 231	. . 3 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → {𝐴, 𝐶} ∈ 𝐸)
36	19, 35	jca 512	. 2 ⊢ ((𝜑 ∧ (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶}) → ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))
37		nb3grpr.v	. . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺)
38	37, 11	nbusgr 28297	. . . . 5 ⊢ (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝐴) = {𝑣 ∈ 𝑉 ∣ {𝐴, 𝑣} ∈ 𝐸})
39	10, 38	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 NeighbVtx 𝐴) = {𝑣 ∈ 𝑉 ∣ {𝐴, 𝑣} ∈ 𝐸})
40	39	adantr 481	. . 3 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝐺 NeighbVtx 𝐴) = {𝑣 ∈ 𝑉 ∣ {𝐴, 𝑣} ∈ 𝐸})
41		nb3grpr.t	. . . . . . . . . 10 ⊢ (𝜑 → 𝑉 = {𝐴, 𝐵, 𝐶})
42		eleq2 2826	. . . . . . . . . 10 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → (𝑣 ∈ 𝑉 ↔ 𝑣 ∈ {𝐴, 𝐵, 𝐶}))
43	41, 42	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ 𝑉 ↔ 𝑣 ∈ {𝐴, 𝐵, 𝐶}))
44	43	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 ∈ 𝑉 ↔ 𝑣 ∈ {𝐴, 𝐵, 𝐶}))
45		vex 3449	. . . . . . . . . . 11 ⊢ 𝑣 ∈ V
46	45	eltp 4649	. . . . . . . . . 10 ⊢ (𝑣 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝑣 = 𝐴 ∨ 𝑣 = 𝐵 ∨ 𝑣 = 𝐶))
47	11	usgredgne 28154	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ USGraph ∧ {𝐴, 𝑣} ∈ 𝐸) → 𝐴 ≠ 𝑣)
48		df-ne 2944	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ≠ 𝑣 ↔ ¬ 𝐴 = 𝑣)
49		pm2.24 124	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 = 𝑣 → (¬ 𝐴 = 𝑣 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)))
50	49	eqcoms 2744	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑣 = 𝐴 → (¬ 𝐴 = 𝑣 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)))
51	50	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ (¬ 𝐴 = 𝑣 → (𝑣 = 𝐴 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)))
52	48, 51	sylbi 216	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ≠ 𝑣 → (𝑣 = 𝐴 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)))
53	47, 52	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ USGraph ∧ {𝐴, 𝑣} ∈ 𝐸) → (𝑣 = 𝐴 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)))
54	53	ex 413	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ USGraph → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐴 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
55	10, 54	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐴 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
56	55	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐴 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
57	56	com3r 87	. . . . . . . . . . 11 ⊢ (𝑣 = 𝐴 → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
58		orc 865	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝐵 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))
59	58	2a1d 26	. . . . . . . . . . 11 ⊢ (𝑣 = 𝐵 → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
60		olc 866	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝐶 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))
61	60	2a1d 26	. . . . . . . . . . 11 ⊢ (𝑣 = 𝐶 → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
62	57, 59, 61	3jaoi 1427	. . . . . . . . . 10 ⊢ ((𝑣 = 𝐴 ∨ 𝑣 = 𝐵 ∨ 𝑣 = 𝐶) → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
63	46, 62	sylbi 216	. . . . . . . . 9 ⊢ (𝑣 ∈ {𝐴, 𝐵, 𝐶} → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
64	63	com12 32	. . . . . . . 8 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 ∈ {𝐴, 𝐵, 𝐶} → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
65	44, 64	sylbid 239	. . . . . . 7 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 ∈ 𝑉 → ({𝐴, 𝑣} ∈ 𝐸 → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶))))
66	65	impd 411	. . . . . 6 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ((𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸) → (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)))
67		eqid 2736	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐵 = 𝐵
68	67	3mix2i 1334	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵 ∨ 𝐵 = 𝐶)
69	1	simp2d 1143	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐵 ∈ 𝑌)
70		eltpg 4646	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ 𝑌 → (𝐵 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵 ∨ 𝐵 = 𝐶)))
71	69, 70	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐵 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵 ∨ 𝐵 = 𝐶)))
72	68, 71	mpbiri 257	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐵 ∈ {𝐴, 𝐵, 𝐶})
73	72	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → 𝐵 ∈ {𝐴, 𝐵, 𝐶})
74		eleq1 2825	. . . . . . . . . . . . . . . . 17 ⊢ (𝑣 = 𝐵 → (𝑣 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝐵 ∈ {𝐴, 𝐵, 𝐶}))
75	74	bicomd 222	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝐵 → (𝐵 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ {𝐴, 𝐵, 𝐶}))
76	75	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (𝐵 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ {𝐴, 𝐵, 𝐶}))
77	73, 76	mpbid 231	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → 𝑣 ∈ {𝐴, 𝐵, 𝐶})
78	42	bicomd 222	. . . . . . . . . . . . . . . 16 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → (𝑣 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ 𝑉))
79	41, 78	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑣 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ 𝑉))
80	79	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → (𝑣 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ 𝑉))
81	77, 80	mpbid 231	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 = 𝐵) → 𝑣 ∈ 𝑉)
82	81	ex 413	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑣 = 𝐵 → 𝑣 ∈ 𝑉))
83	82	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 = 𝐵 → 𝑣 ∈ 𝑉))
84	83	impcom 408	. . . . . . . . . 10 ⊢ ((𝑣 = 𝐵 ∧ (𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))) → 𝑣 ∈ 𝑉)
85		preq2 4695	. . . . . . . . . . . . . . 15 ⊢ (𝐵 = 𝑣 → {𝐴, 𝐵} = {𝐴, 𝑣})
86	85	eleq1d 2822	. . . . . . . . . . . . . 14 ⊢ (𝐵 = 𝑣 → ({𝐴, 𝐵} ∈ 𝐸 ↔ {𝐴, 𝑣} ∈ 𝐸))
87	86	eqcoms 2744	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝐵 → ({𝐴, 𝐵} ∈ 𝐸 ↔ {𝐴, 𝑣} ∈ 𝐸))
88	87	biimpcd 248	. . . . . . . . . . . 12 ⊢ ({𝐴, 𝐵} ∈ 𝐸 → (𝑣 = 𝐵 → {𝐴, 𝑣} ∈ 𝐸))
89	88	ad2antrl 726	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 = 𝐵 → {𝐴, 𝑣} ∈ 𝐸))
90	89	impcom 408	. . . . . . . . . 10 ⊢ ((𝑣 = 𝐵 ∧ (𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))) → {𝐴, 𝑣} ∈ 𝐸)
91	84, 90	jca 512	. . . . . . . . 9 ⊢ ((𝑣 = 𝐵 ∧ (𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))) → (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸))
92	91	ex 413	. . . . . . . 8 ⊢ (𝑣 = 𝐵 → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸)))
93		tpid3g 4733	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐶 ∈ 𝑍 → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
94	93	3ad2ant3 1135	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
95	1, 94	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
96	95	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑣 = 𝐶) → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
97		eleq1 2825	. . . . . . . . . . . . . . . . 17 ⊢ (𝑣 = 𝐶 → (𝑣 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝐶 ∈ {𝐴, 𝐵, 𝐶}))
98	97	bicomd 222	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝐶 → (𝐶 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ {𝐴, 𝐵, 𝐶}))
99	98	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑣 = 𝐶) → (𝐶 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ {𝐴, 𝐵, 𝐶}))
100	96, 99	mpbid 231	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑣 = 𝐶) → 𝑣 ∈ {𝐴, 𝐵, 𝐶})
101	79	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑣 = 𝐶) → (𝑣 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑣 ∈ 𝑉))
102	100, 101	mpbid 231	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 = 𝐶) → 𝑣 ∈ 𝑉)
103	102	ex 413	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑣 = 𝐶 → 𝑣 ∈ 𝑉))
104	103	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 = 𝐶 → 𝑣 ∈ 𝑉))
105	104	impcom 408	. . . . . . . . . 10 ⊢ ((𝑣 = 𝐶 ∧ (𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))) → 𝑣 ∈ 𝑉)
106		preq2 4695	. . . . . . . . . . . . . . 15 ⊢ (𝐶 = 𝑣 → {𝐴, 𝐶} = {𝐴, 𝑣})
107	106	eleq1d 2822	. . . . . . . . . . . . . 14 ⊢ (𝐶 = 𝑣 → ({𝐴, 𝐶} ∈ 𝐸 ↔ {𝐴, 𝑣} ∈ 𝐸))
108	107	eqcoms 2744	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝐶 → ({𝐴, 𝐶} ∈ 𝐸 ↔ {𝐴, 𝑣} ∈ 𝐸))
109	108	biimpcd 248	. . . . . . . . . . . 12 ⊢ ({𝐴, 𝐶} ∈ 𝐸 → (𝑣 = 𝐶 → {𝐴, 𝑣} ∈ 𝐸))
110	109	ad2antll 727	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 = 𝐶 → {𝐴, 𝑣} ∈ 𝐸))
111	110	impcom 408	. . . . . . . . . 10 ⊢ ((𝑣 = 𝐶 ∧ (𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))) → {𝐴, 𝑣} ∈ 𝐸)
112	105, 111	jca 512	. . . . . . . . 9 ⊢ ((𝑣 = 𝐶 ∧ (𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸))) → (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸))
113	112	ex 413	. . . . . . . 8 ⊢ (𝑣 = 𝐶 → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸)))
114	92, 113	jaoi 855	. . . . . . 7 ⊢ ((𝑣 = 𝐵 ∨ 𝑣 = 𝐶) → ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸)))
115	114	com12 32	. . . . . 6 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ((𝑣 = 𝐵 ∨ 𝑣 = 𝐶) → (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸)))
116	66, 115	impbid 211	. . . . 5 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → ((𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸) ↔ (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)))
117	116	abbidv 2805	. . . 4 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → {𝑣 ∣ (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸)} = {𝑣 ∣ (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)})
118		df-rab 3408	. . . 4 ⊢ {𝑣 ∈ 𝑉 ∣ {𝐴, 𝑣} ∈ 𝐸} = {𝑣 ∣ (𝑣 ∈ 𝑉 ∧ {𝐴, 𝑣} ∈ 𝐸)}
119		dfpr2 4605	. . . 4 ⊢ {𝐵, 𝐶} = {𝑣 ∣ (𝑣 = 𝐵 ∨ 𝑣 = 𝐶)}
120	117, 118, 119	3eqtr4g 2801	. . 3 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → {𝑣 ∈ 𝑉 ∣ {𝐴, 𝑣} ∈ 𝐸} = {𝐵, 𝐶})
121	40, 120	eqtrd 2776	. 2 ⊢ ((𝜑 ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)) → (𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶})
122	36, 121	impbida 799	1 ⊢ (𝜑 → ((𝐺 NeighbVtx 𝐴) = {𝐵, 𝐶} ↔ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐴, 𝐶} ∈ 𝐸)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   ∨ w3o 1086   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  {cab 2713   ≠ wne 2943  {crab 3407  {cpr 4588  {ctp 4590  ‘cfv 6496  (class class class)co 7357  Vtxcvtx 27947  Edgcedg 27998  USGraphcusgr 28100   NeighbVtx cnbgr 28280

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-2o 8413  df-oadd 8416  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-dju 9837  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-n0 12414  df-xnn0 12486  df-z 12500  df-uz 12764  df-fz 13425  df-hash 14231  df-edg 27999  df-upgr 28033  df-umgr 28034  df-usgr 28102  df-nbgr 28281

This theorem is referenced by:  nb3grpr  28330  nb3grpr2  28331  nb3gr2nb  28332