Theorem frgr3vlem2 30884

Description: Lemma 2 for frgr3v 30885. (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 3366	. . 3 ⊢ (∃!𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ∃!𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸))
2		eleq1w 2843	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝑦 ∈ {𝐴, 𝐵, 𝐶}))
3		preq1 4690	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → {𝑥, 𝐴} = {𝑦, 𝐴})
4		preq1 4690	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → {𝑥, 𝐵} = {𝑦, 𝐵})
5	3, 4	preq12d 4698	. . . . . . 7 ⊢ (𝑥 = 𝑦 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝑦, 𝐴}, {𝑦, 𝐵}})
6	5	sseq1d 3940	. . . . . 6 ⊢ (𝑥 = 𝑦 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸))
7	2, 6	anbi12d 644	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)))
8	7	eu4 2640	. . . 4 ⊢ (∃!𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦)))
9		frgr3v.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
10		frgr3v.e	. . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺)
11	9, 10	frgr3vlem1 30883	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦))
12	11	3expa 1136	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦))
13	12	biantrud 541	. . . . 5 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ↔ (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ ∀𝑥∀𝑦(((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) ∧ (𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑦, 𝐴}, {𝑦, 𝐵}} ⊆ 𝐸)) → 𝑥 = 𝑦))))
14		vex 3454	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
15	14	eltp 4646	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶))
16		preq1 4690	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → {𝑥, 𝐴} = {𝐴, 𝐴})
17		preq1 4690	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵})
18	16, 17	preq12d 4698	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝐴, 𝐴}, {𝐴, 𝐵}})
19	18	sseq1d 3940	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸))
20		prex 5396	. . . . . . . . . . . . . 14 ⊢ {𝐴, 𝐴} ∈ V
21		prex 5396	. . . . . . . . . . . . . 14 ⊢ {𝐴, 𝐵} ∈ V
22	20, 21	prss 4775	. . . . . . . . . . . . 13 ⊢ (({𝐴, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝐵} ∈ 𝐸) ↔ {{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸)
23	10	usgredgne 29796	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ USGraph ∧ {𝐴, 𝐴} ∈ 𝐸) → 𝐴 ≠ 𝐴)
24	23	adantll 727	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐴, 𝐴} ∈ 𝐸) → 𝐴 ≠ 𝐴)
25		df-ne 2956	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ≠ 𝐴 ↔ ¬ 𝐴 = 𝐴)
26		eqid 2760	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐴 = 𝐴
27	26	pm2.24i 151	. . . . . . . . . . . . . . . . . . 19 ⊢ (¬ 𝐴 = 𝐴 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
28	25, 27	sylbi 220	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ≠ 𝐴 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
29	24, 28	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐴, 𝐴} ∈ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
30	29	ex 418	. . . . . . . . . . . . . . . 16 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) → ({𝐴, 𝐴} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
31	30	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐴, 𝐴} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
32	31	com12 33	. . . . . . . . . . . . . 14 ⊢ ({𝐴, 𝐴} ∈ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
33	32	adantr 486	. . . . . . . . . . . . 13 ⊢ (({𝐴, 𝐴} ∈ 𝐸 ∧ {𝐴, 𝐵} ∈ 𝐸) → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
34	22, 33	sylbir 238	. . . . . . . . . . . 12 ⊢ ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
35	19, 34	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
36		preq1 4690	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐵 → {𝑥, 𝐴} = {𝐵, 𝐴})
37		preq1 4690	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐵 → {𝑥, 𝐵} = {𝐵, 𝐵})
38	36, 37	preq12d 4698	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐵 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝐵, 𝐴}, {𝐵, 𝐵}})
39	38	sseq1d 3940	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐵 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸))
40		prex 5396	. . . . . . . . . . . . . 14 ⊢ {𝐵, 𝐴} ∈ V
41		prex 5396	. . . . . . . . . . . . . 14 ⊢ {𝐵, 𝐵} ∈ V
42	40, 41	prss 4775	. . . . . . . . . . . . 13 ⊢ (({𝐵, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝐵} ∈ 𝐸) ↔ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸)
43	10	usgredgne 29796	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ USGraph ∧ {𝐵, 𝐵} ∈ 𝐸) → 𝐵 ≠ 𝐵)
44	43	adantll 727	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐵, 𝐵} ∈ 𝐸) → 𝐵 ≠ 𝐵)
45		df-ne 2956	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐵 ≠ 𝐵 ↔ ¬ 𝐵 = 𝐵)
46		eqid 2760	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐵 = 𝐵
47	46	pm2.24i 151	. . . . . . . . . . . . . . . . . . 19 ⊢ (¬ 𝐵 = 𝐵 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
48	45, 47	sylbi 220	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ≠ 𝐵 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
49	44, 48	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) ∧ {𝐵, 𝐵} ∈ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))
50	49	ex 418	. . . . . . . . . . . . . . . 16 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) → ({𝐵, 𝐵} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
51	50	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐵, 𝐵} ∈ 𝐸 → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
52	51	com12 33	. . . . . . . . . . . . . 14 ⊢ ({𝐵, 𝐵} ∈ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
53	52	adantl 487	. . . . . . . . . . . . 13 ⊢ (({𝐵, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝐵} ∈ 𝐸) → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
54	42, 53	sylbir 238	. . . . . . . . . . . 12 ⊢ ({{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
55	39, 54	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐵 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
56		preq1 4690	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐶 → {𝑥, 𝐴} = {𝐶, 𝐴})
57		preq1 4690	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐶 → {𝑥, 𝐵} = {𝐶, 𝐵})
58	56, 57	preq12d 4698	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐶 → {{𝑥, 𝐴}, {𝑥, 𝐵}} = {{𝐶, 𝐴}, {𝐶, 𝐵}})
59	58	sseq1d 3940	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐶 → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸))
60		prex 5396	. . . . . . . . . . . . . 14 ⊢ {𝐶, 𝐴} ∈ V
61		prex 5396	. . . . . . . . . . . . . 14 ⊢ {𝐶, 𝐵} ∈ V
62	60, 61	prss 4775	. . . . . . . . . . . . 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 1454	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶) → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
67	15, 66	sylbi 220	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ({{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))
68	67	imp 412	. . . . . . . 8 ⊢ ((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) → ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
69	68	com12 33	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → ((𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
70	69	exlimdv 1965	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) → (∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸) → ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)))
71		prssi 4776	. . . . . . . . . . 11 ⊢ (({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸) → {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)
72	71	adantl 487	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)
73	72	3mix3d 1357	. . . . . . . . 9 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 ∨ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 ∨ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸))
74	19, 39, 59	rextpg 4656	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 ∨ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 ∨ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)))
75	74	ad3antrrr 743	. . . . . . . . 9 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({{𝐴, 𝐴}, {𝐴, 𝐵}} ⊆ 𝐸 ∨ {{𝐵, 𝐴}, {𝐵, 𝐵}} ⊆ 𝐸 ∨ {{𝐶, 𝐴}, {𝐶, 𝐵}} ⊆ 𝐸)))
76	73, 75	mpbird 260	. . . . . . . 8 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸)
77		df-rex 3087	. . . . . . . 8 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸))
78	76, 77	sylib 221	. . . . . . 7 ⊢ (((((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph)) ∧ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸)) → ∃𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} ∧ {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸))
79	78	ex 418	. . . . . 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 418	1 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝐺 ∈ USGraph) → (∃!𝑥 ∈ {𝐴, 𝐵, 𝐶} {{𝑥, 𝐴}, {𝑥, 𝐵}} ⊆ 𝐸 ↔ ({𝐶, 𝐴} ∈ 𝐸 ∧ {𝐶, 𝐵} ∈ 𝐸))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ w3o 1102   ∧ w3a 1103  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃!weu 2593   ≠ wne 2955  ∃wrex 3086  ∃!wreu 3363   ⊆ wss 3896  {cpr 4586  {ctp 4588  ‘cfv 6543  Vtxcvtx 29583  Edgcedg 29634  USGraphcusgr 29739

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-cnex 11263  ax-resscn 11264  ax-1cn 11265  ax-icn 11266  ax-addcl 11267  ax-addrcl 11268  ax-mulcl 11269  ax-mulrcl 11270  ax-mulcom 11271  ax-addass 11272  ax-mulass 11273  ax-distr 11274  ax-i2m1 11275  ax-1ne0 11276  ax-1rid 11277  ax-rnegex 11278  ax-rrecex 11279  ax-cnre 11280  ax-pre-lttri 11281  ax-pre-lttrn 11282  ax-pre-ltadd 11283  ax-pre-mulgt0 11284

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7882  df-1st 8005  df-2nd 8006  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-rdg 8426  df-1o 8484  df-oadd 8488  df-er 8725  df-en 8982  df-dom 8983  df-sdom 8984  df-fin 8985  df-dju 9989  df-card 10027  df-pnf 11352  df-mnf 11353  df-xr 11354  df-ltxr 11355  df-le 11356  df-sub 11550  df-neg 11551  df-nn 12343  df-2 12412  df-n0 12614  df-z 12701  df-uz 12973  df-fz 13647  df-hash 14482  df-edg 29635  df-umgr 29670  df-usgr 29741

This theorem is used by:  frgr3v  30885