Theorem frgr3vlem2 30636

Description: Lemma 2 for frgr3v 30637. (Contributed by Alexander van der Vekens, 4-Oct-2017.) (Revised by AV, 29-Mar-2021.)

Hypotheses

Ref	Expression
frgr3v.v	⊢ 𝑉 = (Vtx‘𝐺)
frgr3v.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
frgr3vlem2	⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) → (∃!𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝐸   𝑥,𝐺   𝑥,𝑉   𝑥,𝑋   𝑥,𝑌   𝑥,𝑍

Proof of Theorem frgr3vlem2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-reu 3369	. . 3 ⊢ (∃!𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ∃!𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸))
2		eleq1w 2845	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑦 ∈ {𝐴, 𝐵, 𝐶}))
3		preq1 4698	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → {𝑥, 𝐴} = {𝑦, 𝐴})
4		preq1 4698	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → {𝑥, 𝐵} = {𝑦, 𝐵})
5	3, 4	preq12d 4706	. . . . . . 7 ⊢ (𝑥 = 𝑦 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝑦, 𝐴}, {𝑦, 𝐵}})
6	5	sseq1d 3967	. . . . . 6 ⊢ (𝑥 = 𝑦 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸))
7	2, 6	anbi12d 643	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)))
8	7	eu4 2642	. . . 4 ⊢ (∃!𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦)))
9		frgr3v.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
10		frgr3v.e	. . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺)
11	9, 10	frgr3vlem1 30635	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦))
12	11	3expa 1135	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦))
13	12	biantrud 540	. . . . 5 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦))))
14		vex 3458	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
15	14	eltp 4654	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶))
16		preq1 4698	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → {𝑥, 𝐴} = {𝐴, 𝐴})
17		preq1 4698	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵})
18	16, 17	preq12d 4706	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝐴, 𝐴}, {𝐴, 𝐵}})
19	18	sseq1d 3967	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸))
20		prex 5408	. . . . . . . . . . . . . 14 ⊢ {𝐴, 𝐴} ∈ V
21		prex 5408	. . . . . . . . . . . . . 14 ⊢ {𝐴, 𝐵} ∈ V
22	20, 21	prss 4785	. . . . . . . . . . . . 13 ⊢ (({𝐴, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝐵} ∈ 𝐸) ↔ {{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸)
23	10	usgredgne 29567	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ USGraph ∧ {𝐴, 𝐴} ∈ 𝐸) → 𝐴 ≠ 𝐴)
24	23	adantll 726	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐴, 𝐴} ∈ 𝐸) → 𝐴 ≠ 𝐴)
25		df-ne 2958	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ≠ 𝐴 ↔ ¬ 𝐴 = 𝐴)
26		eqid 2762	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐴 = 𝐴
27	26	pm2.24i 151	. . . . . . . . . . . . . . . . . . 19 ⊢ (¬ 𝐴 = 𝐴 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
28	25, 27	sylbi 220	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ≠ 𝐴 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
29	24, 28	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐴, 𝐴} ∈ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
30	29	ex 417	. . . . . . . . . . . . . . . 16 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) → ({𝐴, 𝐴} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
31	30	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐴, 𝐴} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
32	31	com12 33	. . . . . . . . . . . . . 14 ⊢ ({𝐴, 𝐴} ∈ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
33	32	adantr 485	. . . . . . . . . . . . 13 ⊢ (({𝐴, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝐵} ∈ 𝐸) → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
34	22, 33	sylbir 238	. . . . . . . . . . . 12 ⊢ ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
35	19, 34	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
36		preq1 4698	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐵 → {𝑥, 𝐴} = {𝐵, 𝐴})
37		preq1 4698	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐵 → {𝑥, 𝐵} = {𝐵, 𝐵})
38	36, 37	preq12d 4706	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐵 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝐵, 𝐴}, {𝐵, 𝐵}})
39	38	sseq1d 3967	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐵 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸))
40		prex 5408	. . . . . . . . . . . . . 14 ⊢ {𝐵, 𝐴} ∈ V
41		prex 5408	. . . . . . . . . . . . . 14 ⊢ {𝐵, 𝐵} ∈ V
42	40, 41	prss 4785	. . . . . . . . . . . . 13 ⊢ (({𝐵, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝐵} ∈ 𝐸) ↔ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸)
43	10	usgredgne 29567	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ USGraph ∧ {𝐵, 𝐵} ∈ 𝐸) → 𝐵 ≠ 𝐵)
44	43	adantll 726	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐵, 𝐵} ∈ 𝐸) → 𝐵 ≠ 𝐵)
45		df-ne 2958	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐵 ≠ 𝐵 ↔ ¬ 𝐵 = 𝐵)
46		eqid 2762	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐵 = 𝐵
47	46	pm2.24i 151	. . . . . . . . . . . . . . . . . . 19 ⊢ (¬ 𝐵 = 𝐵 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
48	45, 47	sylbi 220	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ≠ 𝐵 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
49	44, 48	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐵, 𝐵} ∈ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
50	49	ex 417	. . . . . . . . . . . . . . . 16 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) → ({𝐵, 𝐵} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
51	50	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐵, 𝐵} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
52	51	com12 33	. . . . . . . . . . . . . 14 ⊢ ({𝐵, 𝐵} ∈ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
53	52	adantl 486	. . . . . . . . . . . . 13 ⊢ (({𝐵, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝐵} ∈ 𝐸) → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
54	42, 53	sylbir 238	. . . . . . . . . . . 12 ⊢ ({{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
55	39, 54	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐵 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
56		preq1 4698	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐶 → {𝑥, 𝐴} = {𝐶, 𝐴})
57		preq1 4698	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐶 → {𝑥, 𝐵} = {𝐶, 𝐵})
58	56, 57	preq12d 4706	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐶 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝐶, 𝐴}, {𝐶, 𝐵}})
59	58	sseq1d 3967	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐶 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸))
60		prex 5408	. . . . . . . . . . . . . 14 ⊢ {𝐶, 𝐴} ∈ V
61		prex 5408	. . . . . . . . . . . . . 14 ⊢ {𝐶, 𝐵} ∈ V
62	60, 61	prss 4785	. . . . . . . . . . . . 13 ⊢ (({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸) ↔ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)
63		ax-1 6	. . . . . . . . . . . . 13 ⊢ (({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸) → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
64	62, 63	sylbir 238	. . . . . . . . . . . 12 ⊢ ({{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
65	59, 64	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐶 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
66	35, 55, 65	3jaoi 1453	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶) → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
67	15, 66	sylbi 220	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
68	67	imp 411	. . . . . . . 8 ⊢ ((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
69	68	com12 33	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
70	69	exlimdv 1962	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
71		prssi 4786	. . . . . . . . . . 11 ⊢ (({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸) → {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)
72	71	adantl 486	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)
73	72	3mix3d 1356	. . . . . . . . 9 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 ∨ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 ∨ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸))
74	19, 39, 59	rextpg 4664	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 ∨ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 ∨ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)))
75	74	ad3antrrr 742	. . . . . . . . 9 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 ∨ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 ∨ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)))
76	73, 75	mpbird 260	. . . . . . . 8 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸)
77		df-rex 3089	. . . . . . . 8 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸))
78	76, 77	sylib 221	. . . . . . 7 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → ∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸))
79	78	ex 417	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸) → ∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸)))
80	70, 79	impbid 215	. . . . 5 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
81	13, 80	bitr3d 284	. . . 4 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ((∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦)) ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
82	8, 81	bitrid 286	. . 3 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (∃!𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
83	1, 82	bitrid 286	. 2 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (∃!𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
84	83	ex 417	1 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) → (∃!𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ w3o 1101   ∧ w3a 1102  ∀wal 1567   = wceq 1569  ∃wex 1808   ∈ wcel 2142  ∃!weu 2595   ≠ wne 2957  ∃wrex 3088  ∃!wreu 3366   ⊆ wss 3904  {cpr 4590  {ctp 4592  ‘cfv 6536  Vtxcvtx 29357  Edgcedg 29408  USGraphcusgr 29510

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-1o 8451  df-oadd 8455  df-er 8692  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-dju 9894  df-card 9932  df-pnf 11251  df-mnf 11252  df-xr 11253  df-ltxr 11254  df-le 11255  df-sub 11449  df-neg 11450  df-nn 12240  df-2 12309  df-n0 12511  df-z 12598  df-uz 12869  df-fz 13542  df-hash 14374  df-edg 29409  df-umgr 29444  df-usgr 29512

This theorem is used by:  frgr3v  30637