frgrnbnb - Metamath Proof Explorer

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

Theorem frgrnbnb 30383

Description: If two neighbors 𝑈 and 𝑊 of a vertex 𝑋 have a common neighbor 𝐴 in a friendship graph, then this common neighbor 𝐴 must be the vertex 𝑋. (Contributed by Alexander van der Vekens, 19-Dec-2017.) (Revised by AV, 2-Apr-2021.) (Proof shortened by AV, 13-Feb-2022.)

**Hypotheses**
Ref	Expression
frgrnbnb.e	⊢ 𝐸 = (Edg‘𝐺)
frgrnbnb.n	⊢ 𝐷 = (𝐺 NeighbVtx 𝑋)

**Assertion**
Ref	Expression
frgrnbnb	⊢ ((𝐺 ∈ FriendGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) ∧ 𝑈 ≠ 𝑊) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋))

**Proof of Theorem frgrnbnb**
Step	Hyp	Ref	Expression
1		frgrusgr 30351	. . 3 ⊢ (𝐺 ∈ FriendGraph → 𝐺 ∈ USGraph)
2		frgrnbnb.n	. . . . . . . . . 10 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋)
3	2	eleq2i 2833	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐷 ↔ 𝑈 ∈ (𝐺 NeighbVtx 𝑋))
4		frgrnbnb.e	. . . . . . . . . . 11 ⊢ 𝐸 = (Edg‘𝐺)
5	4	nbusgreledg 29442	. . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → (𝑈 ∈ (𝐺 NeighbVtx 𝑋) ↔ {𝑈, 𝑋} ∈ 𝐸))
6	5	biimpd 231	. . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (𝑈 ∈ (𝐺 NeighbVtx 𝑋) → {𝑈, 𝑋} ∈ 𝐸))
7	3, 6	biimtrid 244	. . . . . . . 8 ⊢ (𝐺 ∈ USGraph → (𝑈 ∈ 𝐷 → {𝑈, 𝑋} ∈ 𝐸))
8	2	eleq2i 2833	. . . . . . . . 9 ⊢ (𝑊 ∈ 𝐷 ↔ 𝑊 ∈ (𝐺 NeighbVtx 𝑋))
9	4	nbusgreledg 29442	. . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → (𝑊 ∈ (𝐺 NeighbVtx 𝑋) ↔ {𝑊, 𝑋} ∈ 𝐸))
10	9	biimpd 231	. . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → (𝑊 ∈ (𝐺 NeighbVtx 𝑋) → {𝑊, 𝑋} ∈ 𝐸))
11	8, 10	biimtrid 244	. . . . . . . 8 ⊢ (𝐺 ∈ USGraph → (𝑊 ∈ 𝐷 → {𝑊, 𝑋} ∈ 𝐸))
12	7, 11	anim12d 616	. . . . . . 7 ⊢ (𝐺 ∈ USGraph → ((𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) → ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)))
13	12	imp 408	. . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸))
14		eqid 2741	. . . . . . . . . 10 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
15	14	nbgrisvtx 29430	. . . . . . . . 9 ⊢ (𝑈 ∈ (𝐺 NeighbVtx 𝑋) → 𝑈 ∈ (Vtx‘𝐺))
16	15, 2	eleq2s 2859	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐷 → 𝑈 ∈ (Vtx‘𝐺))
17	14	nbgrisvtx 29430	. . . . . . . . 9 ⊢ (𝑊 ∈ (𝐺 NeighbVtx 𝑋) → 𝑊 ∈ (Vtx‘𝐺))
18	17, 2	eleq2s 2859	. . . . . . . 8 ⊢ (𝑊 ∈ 𝐷 → 𝑊 ∈ (Vtx‘𝐺))
19	16, 18	anim12i 620	. . . . . . 7 ⊢ ((𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) → (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))
20	19	adantl 483	. . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))
21	4, 14	usgrpredgv 29286	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ USGraph ∧ {𝑈, 𝐴} ∈ 𝐸) → (𝑈 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)))
22	21	ad2ant2r 754	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) → (𝑈 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)))
23		ax-1 6	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐴 = 𝑋 → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋))
24	23	2a1d 26	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐴 = 𝑋 → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋))))
25	24	2a1d 26	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐴 = 𝑋 → (𝑈 ≠ 𝑊 → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋))))))
26		simpll 773	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝐺 ∈ USGraph)
27		simprrr 788	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) → 𝑊 ∈ (Vtx‘𝐺))
28	27	adantr 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝑊 ∈ (Vtx‘𝐺))
29		simprrl 787	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) → 𝑈 ∈ (Vtx‘𝐺))
30	29	adantr 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝑈 ∈ (Vtx‘𝐺))
31		necom 2989	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 ⊢ (𝑈 ≠ 𝑊 ↔ 𝑊 ≠ 𝑈)
32	31	biimpi 218	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝑈 ≠ 𝑊 → 𝑊 ≠ 𝑈)
33	32	adantl 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → 𝑊 ≠ 𝑈)
34	33	adantl 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝑊 ≠ 𝑈)
35	28, 30, 34	3jca 1135	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → (𝑊 ∈ (Vtx‘𝐺) ∧ 𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ≠ 𝑈))
36		simprll 785	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) → 𝑋 ∈ (Vtx‘𝐺))
37	36	adantr 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝑋 ∈ (Vtx‘𝐺))
38		simprlr 786	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) → 𝐴 ∈ (Vtx‘𝐺))
39	38	adantr 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝐴 ∈ (Vtx‘𝐺))
40		necom 2989	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 ⊢ (𝐴 ≠ 𝑋 ↔ 𝑋 ≠ 𝐴)
41	40	biimpi 218	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝐴 ≠ 𝑋 → 𝑋 ≠ 𝐴)
42	41	adantr 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → 𝑋 ≠ 𝐴)
43	42	adantl 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝑋 ≠ 𝐴)
44	37, 39, 43	3jca 1135	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → (𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺) ∧ 𝑋 ≠ 𝐴))
45	26, 35, 44	3jca 1135	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → (𝐺 ∈ USGraph ∧ (𝑊 ∈ (Vtx‘𝐺) ∧ 𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ≠ 𝑈) ∧ (𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺) ∧ 𝑋 ≠ 𝐴)))
46	45	ad4ant14 759	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → (𝐺 ∈ USGraph ∧ (𝑊 ∈ (Vtx‘𝐺) ∧ 𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ≠ 𝑈) ∧ (𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺) ∧ 𝑋 ≠ 𝐴)))
47		prcom 4666	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 ⊢ {𝑈, 𝑋} = {𝑋, 𝑈}
48	47	eleq1i 2832	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ ({𝑈, 𝑋} ∈ 𝐸 ↔ {𝑋, 𝑈} ∈ 𝐸)
49	48	biimpi 218	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ({𝑈, 𝑋} ∈ 𝐸 → {𝑋, 𝑈} ∈ 𝐸)
50	49	anim1ci 623	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → ({𝑊, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝑈} ∈ 𝐸))
51	50	adantl 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ({𝑊, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝑈} ∈ 𝐸))
52		prcom 4666	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ {𝑊, 𝐴} = {𝐴, 𝑊}
53	52	eleq1i 2832	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ({𝑊, 𝐴} ∈ 𝐸 ↔ {𝐴, 𝑊} ∈ 𝐸)
54	53	biimpi 218	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ({𝑊, 𝐴} ∈ 𝐸 → {𝐴, 𝑊} ∈ 𝐸)
55	54	anim2i 624	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝑊} ∈ 𝐸))
56	51, 55	anim12i 620	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) → (({𝑊, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝑈} ∈ 𝐸) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝑊} ∈ 𝐸)))
57	56	adantr 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → (({𝑊, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝑈} ∈ 𝐸) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝑊} ∈ 𝐸)))
58	14, 4	4cyclusnfrgr 30382	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝐺 ∈ USGraph ∧ (𝑊 ∈ (Vtx‘𝐺) ∧ 𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ≠ 𝑈) ∧ (𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺) ∧ 𝑋 ≠ 𝐴)) → ((({𝑊, 𝑋} ∈ 𝐸 ∧ {𝑋, 𝑈} ∈ 𝐸) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝑊} ∈ 𝐸)) → 𝐺 ∉ FriendGraph ))
59	46, 57, 58	sylc 65	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → 𝐺 ∉ FriendGraph )
60		df-nel 3041	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝐺 ∉ FriendGraph ↔ ¬ 𝐺 ∈ FriendGraph )
61	59, 60	sylib 220	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → ¬ 𝐺 ∈ FriendGraph )
62	61	pm2.21d 121	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) ∧ (𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊)) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋))
63	62	ex 414	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) → ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋)))
64	63	com23 86	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((((𝐺 ∈ USGraph ∧ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)))) ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) → (𝐺 ∈ FriendGraph → ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → 𝐴 = 𝑋)))
65	64	exp41 436	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐺 ∈ USGraph → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (𝐺 ∈ FriendGraph → ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → 𝐴 = 𝑋))))))
66	65	com25 99	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ FriendGraph → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → 𝐴 = 𝑋))))))
67	1, 66	mpcom 38	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐺 ∈ FriendGraph → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → 𝐴 = 𝑋)))))
68	67	com15 101	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐴 ≠ 𝑋 ∧ 𝑈 ≠ 𝑊) → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋)))))
69	68	ex 414	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐴 ≠ 𝑋 → (𝑈 ≠ 𝑊 → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋))))))
70	25, 69	pm2.61ine 3019	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑈 ≠ 𝑊 → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋)))))
71	70	imp 408	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋))))
72	71	com13 88	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) ∧ (𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺))) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋))))
73	72	ex 414	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → (𝐺 ∈ FriendGraph → 𝐴 = 𝑋)))))
74	73	com25 99	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) → (𝐺 ∈ FriendGraph → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋)))))
75	74	ex 414	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ (Vtx‘𝐺) → (𝐴 ∈ (Vtx‘𝐺) → (𝐺 ∈ FriendGraph → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋))))))
76	14	nbgrcl 29424	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑈 ∈ (𝐺 NeighbVtx 𝑋) → 𝑋 ∈ (Vtx‘𝐺))
77	76, 2	eleq2s 2859	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑈 ∈ 𝐷 → 𝑋 ∈ (Vtx‘𝐺))
78	77	adantr 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) → 𝑋 ∈ (Vtx‘𝐺))
79	78	adantl 483	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → 𝑋 ∈ (Vtx‘𝐺))
80	75, 79	syl11 33	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ (Vtx‘𝐺) → ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (𝐺 ∈ FriendGraph → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋))))))
81	80	com34 91	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (Vtx‘𝐺) → ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (𝐺 ∈ FriendGraph → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋))))))
82	81	impd 412	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ (Vtx‘𝐺) → (((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) → (𝐺 ∈ FriendGraph → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋)))))
83	82	adantl 483	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝐴 ∈ (Vtx‘𝐺)) → (((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) → (𝐺 ∈ FriendGraph → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋)))))
84	22, 83	mpcom 38	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) ∧ ({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸)) → (𝐺 ∈ FriendGraph → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋))))
85	84	ex 414	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → (𝐺 ∈ FriendGraph → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → 𝐴 = 𝑋)))))
86	85	com25 99	. . . . . . . . 9 ⊢ ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → (𝐺 ∈ FriendGraph → ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋)))))
87	86	com14 96	. . . . . . . 8 ⊢ ((𝑈 ≠ 𝑊 ∧ ({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸)) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → (𝐺 ∈ FriendGraph → ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋)))))
88	87	ex 414	. . . . . . 7 ⊢ (𝑈 ≠ 𝑊 → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → (𝐺 ∈ FriendGraph → ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋))))))
89	88	com15 101	. . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (({𝑈, 𝑋} ∈ 𝐸 ∧ {𝑊, 𝑋} ∈ 𝐸) → ((𝑈 ∈ (Vtx‘𝐺) ∧ 𝑊 ∈ (Vtx‘𝐺)) → (𝐺 ∈ FriendGraph → (𝑈 ≠ 𝑊 → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋))))))
90	13, 20, 89	mp2d 49	. . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷)) → (𝐺 ∈ FriendGraph → (𝑈 ≠ 𝑊 → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋))))
91	90	ex 414	. . . 4 ⊢ (𝐺 ∈ USGraph → ((𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) → (𝐺 ∈ FriendGraph → (𝑈 ≠ 𝑊 → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋)))))
92	91	com23 86	. . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ FriendGraph → ((𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) → (𝑈 ≠ 𝑊 → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋)))))
93	1, 92	mpcom 38	. 2 ⊢ (𝐺 ∈ FriendGraph → ((𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) → (𝑈 ≠ 𝑊 → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋))))
94	93	3imp 1117	1 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑈 ∈ 𝐷 ∧ 𝑊 ∈ 𝐷) ∧ 𝑈 ≠ 𝑊) → (({𝑈, 𝐴} ∈ 𝐸 ∧ {𝑊, 𝐴} ∈ 𝐸) → 𝐴 = 𝑋))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 ∉ wnel 3040 {cpr 4559 ‘cfv 6488 (class class class)co 7359 Vtxcvtx 29085 Edgcedg 29136 USGraphcusgr 29238 NeighbVtx cnbgr 29421 FriendGraph cfrgr 30348

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7933 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9820 df-card 9858 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-nn 12170 df-2 12239 df-n0 12433 df-xnn0 12506 df-z 12520 df-uz 12784 df-fz 13457 df-hash 14288 df-edg 29137 df-upgr 29171 df-umgr 29172 df-usgr 29240 df-nbgr 29422 df-frgr 30349

This theorem is referenced by: frgrncvvdeqlem8 30396

W3C validator