grimgrtri - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > grimgrtri		Structured version Visualization version GIF version

Theorem grimgrtri 48231

Description: Graph isomorphisms map triangles onto triangles. (Contributed by AV, 27-Jul-2025.) (Proof shortened by AV, 24-Aug-2025.)

**Hypotheses**
Ref	Expression
grimgrtri.g	⊢ (𝜑 → 𝐺 ∈ UHGraph)
grimgrtri.h	⊢ (𝜑 → 𝐻 ∈ UHGraph)
grimgrtri.n	⊢ (𝜑 → 𝐹 ∈ (𝐺 GraphIso 𝐻))
grimgrtri.t	⊢ (𝜑 → 𝑇 ∈ (GrTriangles‘𝐺))

**Assertion**
Ref	Expression
grimgrtri	⊢ (𝜑 → (𝐹 “ 𝑇) ∈ (GrTriangles‘𝐻))

Proof of Theorem grimgrtri Dummy variables 𝑎 𝑏 𝑐 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		grimgrtri.t	. . . 4 ⊢ (𝜑 → 𝑇 ∈ (GrTriangles‘𝐺))
2		eqid 2737	. . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
3		eqid 2737	. . . . 5 ⊢ (Edg‘𝐺) = (Edg‘𝐺)
4	2, 3	grtriprop 48223	. . . 4 ⊢ (𝑇 ∈ (GrTriangles‘𝐺) → ∃𝑎 ∈ (Vtx‘𝐺)∃𝑏 ∈ (Vtx‘𝐺)∃𝑐 ∈ (Vtx‘𝐺)(𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))))
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → ∃𝑎 ∈ (Vtx‘𝐺)∃𝑏 ∈ (Vtx‘𝐺)∃𝑐 ∈ (Vtx‘𝐺)(𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))))
6		grimgrtri.n	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝐺 GraphIso 𝐻))
7		eqid 2737	. . . . . . . . . 10 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
8	2, 7	grimf1o 48166	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
9		f1of1 6774	. . . . . . . . 9 ⊢ (𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) → 𝐹:(Vtx‘𝐺)–1-1→(Vtx‘𝐻))
10	6, 8, 9	3syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(Vtx‘𝐺)–1-1→(Vtx‘𝐻))
11	10	ad3antrrr 731	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → 𝐹:(Vtx‘𝐺)–1-1→(Vtx‘𝐻))
12		simplrl 777	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) → 𝑎 ∈ (Vtx‘𝐺))
13	12	adantr 480	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → 𝑎 ∈ (Vtx‘𝐺))
14		simprr 773	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) → 𝑏 ∈ (Vtx‘𝐺))
15	14	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) → 𝑏 ∈ (Vtx‘𝐺))
16	15	adantr 480	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → 𝑏 ∈ (Vtx‘𝐺))
17		simplr 769	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → 𝑐 ∈ (Vtx‘𝐺))
18	13, 16, 17	3jca 1129	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺) ∧ 𝑐 ∈ (Vtx‘𝐺)))
19		3simpa 1149	. . . . . . . 8 ⊢ ((𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))) → (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3))
20	19	adantl 481	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3))
21		grtrimap 48230	. . . . . . . 8 ⊢ (𝐹:(Vtx‘𝐺)–1-1→(Vtx‘𝐻) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3)) → (((𝐹‘𝑎) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑏) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑐) ∈ (Vtx‘𝐻)) ∧ (𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)} ∧ (♯‘(𝐹 “ 𝑇)) = 3)))
22	21	imp 406	. . . . . . 7 ⊢ ((𝐹:(Vtx‘𝐺)–1-1→(Vtx‘𝐻) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3))) → (((𝐹‘𝑎) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑏) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑐) ∈ (Vtx‘𝐻)) ∧ (𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)} ∧ (♯‘(𝐹 “ 𝑇)) = 3))
23	11, 18, 20, 22	syl12anc 837	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → (((𝐹‘𝑎) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑏) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑐) ∈ (Vtx‘𝐻)) ∧ (𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)} ∧ (♯‘(𝐹 “ 𝑇)) = 3))
24		grimgrtri.g	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ UHGraph)
25		grimgrtri.h	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ UHGraph)
26		eqid 2737	. . . . . . . . . . . . . . 15 ⊢ (Edg‘𝐻) = (Edg‘𝐻)
27	2, 3, 26	grimedg 48217	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ({𝑎, 𝑏} ∈ (Edg‘𝐺) ↔ ((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺))))
28	2, 3, 26	grimedg 48217	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ({𝑎, 𝑐} ∈ (Edg‘𝐺) ↔ ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺))))
29	2, 3, 26	grimedg 48217	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ({𝑏, 𝑐} ∈ (Edg‘𝐺) ↔ ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺))))
30	27, 28, 29	3anbi123d 1439	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)) ↔ (((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺)))))
31		f1ofn 6776	. . . . . . . . . . . . . . 15 ⊢ (𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) → 𝐹 Fn (Vtx‘𝐺))
32		simpl 482	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → 𝐹 Fn (Vtx‘𝐺))
33		simprll 779	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → 𝑎 ∈ (Vtx‘𝐺))
34		simprlr 780	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → 𝑏 ∈ (Vtx‘𝐺))
35		fnimapr 6918	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ 𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) → (𝐹 “ {𝑎, 𝑏}) = {(𝐹‘𝑎), (𝐹‘𝑏)})
36	32, 33, 34, 35	syl3anc 1374	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → (𝐹 “ {𝑎, 𝑏}) = {(𝐹‘𝑎), (𝐹‘𝑏)})
37	36	eleq1d 2822	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → ((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻)))
38	37	biimpd 229	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → ((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) → {(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻)))
39	38	adantrd 491	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → (((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺)) → {(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻)))
40		simprr 773	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → 𝑐 ∈ (Vtx‘𝐺))
41		fnimapr 6918	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ 𝑎 ∈ (Vtx‘𝐺) ∧ 𝑐 ∈ (Vtx‘𝐺)) → (𝐹 “ {𝑎, 𝑐}) = {(𝐹‘𝑎), (𝐹‘𝑐)})
42	32, 33, 40, 41	syl3anc 1374	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → (𝐹 “ {𝑎, 𝑐}) = {(𝐹‘𝑎), (𝐹‘𝑐)})
43	42	eleq1d 2822	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
44	43	biimpd 229	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) → {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
45	44	adantrd 491	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → (((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺)) → {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
46		fnimapr 6918	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺) ∧ 𝑐 ∈ (Vtx‘𝐺)) → (𝐹 “ {𝑏, 𝑐}) = {(𝐹‘𝑏), (𝐹‘𝑐)})
47	32, 34, 40, 46	syl3anc 1374	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → (𝐹 “ {𝑏, 𝑐}) = {(𝐹‘𝑏), (𝐹‘𝑐)})
48	47	eleq1d 2822	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
49	48	biimpd 229	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) → {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
50	49	adantrd 491	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → (((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺)) → {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
51	39, 45, 50	3anim123d 1446	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 Fn (Vtx‘𝐺) ∧ ((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺))) → ((((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺))) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻))))
52	51	ex 412	. . . . . . . . . . . . . . . 16 ⊢ (𝐹 Fn (Vtx‘𝐺) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ((((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺))) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
53	52	com23 86	. . . . . . . . . . . . . . 15 ⊢ (𝐹 Fn (Vtx‘𝐺) → ((((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺))) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
54	8, 31, 53	3syl 18	. . . . . . . . . . . . . 14 ⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → ((((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺))) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
55	54	3ad2ant3 1136	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ((((𝐹 “ {𝑎, 𝑏}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑏} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑎, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑎, 𝑐} ⊆ (Vtx‘𝐺)) ∧ ((𝐹 “ {𝑏, 𝑐}) ∈ (Edg‘𝐻) ∧ {𝑏, 𝑐} ⊆ (Vtx‘𝐺))) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
56	30, 55	sylbid 240	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
57	56	2a1d 26	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (𝑇 = {𝑎, 𝑏, 𝑐} → ((♯‘𝑇) = 3 → (({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))))
58	57	3impd 1350	. . . . . . . . . 10 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ((𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
59	58	com23 86	. . . . . . . . 9 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ((𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
60	24, 25, 6, 59	syl3anc 1374	. . . . . . . 8 ⊢ (𝜑 → (((𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺)) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ((𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
61	60	impl 455	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) → ((𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻))))
62	61	imp 406	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
63		tpeq1 4700	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐹‘𝑎) → {𝑥, 𝑦, 𝑧} = {(𝐹‘𝑎), 𝑦, 𝑧})
64	63	eqeq2d 2748	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘𝑎) → ((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ↔ (𝐹 “ 𝑇) = {(𝐹‘𝑎), 𝑦, 𝑧}))
65		preq1 4691	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐹‘𝑎) → {𝑥, 𝑦} = {(𝐹‘𝑎), 𝑦})
66	65	eleq1d 2822	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐹‘𝑎) → ({𝑥, 𝑦} ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑎), 𝑦} ∈ (Edg‘𝐻)))
67		preq1 4691	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐹‘𝑎) → {𝑥, 𝑧} = {(𝐹‘𝑎), 𝑧})
68	67	eleq1d 2822	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐹‘𝑎) → ({𝑥, 𝑧} ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻)))
69	66, 68	3anbi12d 1440	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘𝑎) → (({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻)) ↔ ({(𝐹‘𝑎), 𝑦} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻))))
70	64, 69	3anbi13d 1441	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘𝑎) → (((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻))) ↔ ((𝐹 “ 𝑇) = {(𝐹‘𝑎), 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({(𝐹‘𝑎), 𝑦} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻)))))
71		tpeq2 4701	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘𝑏) → {(𝐹‘𝑎), 𝑦, 𝑧} = {(𝐹‘𝑎), (𝐹‘𝑏), 𝑧})
72	71	eqeq2d 2748	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘𝑏) → ((𝐹 “ 𝑇) = {(𝐹‘𝑎), 𝑦, 𝑧} ↔ (𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), 𝑧}))
73		preq2 4692	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘𝑏) → {(𝐹‘𝑎), 𝑦} = {(𝐹‘𝑎), (𝐹‘𝑏)})
74	73	eleq1d 2822	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘𝑏) → ({(𝐹‘𝑎), 𝑦} ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻)))
75		preq1 4691	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘𝑏) → {𝑦, 𝑧} = {(𝐹‘𝑏), 𝑧})
76	75	eleq1d 2822	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘𝑏) → ({𝑦, 𝑧} ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑏), 𝑧} ∈ (Edg‘𝐻)))
77	74, 76	3anbi13d 1441	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘𝑏) → (({(𝐹‘𝑎), 𝑦} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻)) ↔ ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), 𝑧} ∈ (Edg‘𝐻))))
78	72, 77	3anbi13d 1441	. . . . . . . . 9 ⊢ (𝑦 = (𝐹‘𝑏) → (((𝐹 “ 𝑇) = {(𝐹‘𝑎), 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({(𝐹‘𝑎), 𝑦} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻))) ↔ ((𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), 𝑧} ∈ (Edg‘𝐻)))))
79		tpeq3 4702	. . . . . . . . . . 11 ⊢ (𝑧 = (𝐹‘𝑐) → {(𝐹‘𝑎), (𝐹‘𝑏), 𝑧} = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)})
80	79	eqeq2d 2748	. . . . . . . . . 10 ⊢ (𝑧 = (𝐹‘𝑐) → ((𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), 𝑧} ↔ (𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)}))
81		preq2 4692	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝐹‘𝑐) → {(𝐹‘𝑎), 𝑧} = {(𝐹‘𝑎), (𝐹‘𝑐)})
82	81	eleq1d 2822	. . . . . . . . . . 11 ⊢ (𝑧 = (𝐹‘𝑐) → ({(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
83		preq2 4692	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝐹‘𝑐) → {(𝐹‘𝑏), 𝑧} = {(𝐹‘𝑏), (𝐹‘𝑐)})
84	83	eleq1d 2822	. . . . . . . . . . 11 ⊢ (𝑧 = (𝐹‘𝑐) → ({(𝐹‘𝑏), 𝑧} ∈ (Edg‘𝐻) ↔ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))
85	82, 84	3anbi23d 1442	. . . . . . . . . 10 ⊢ (𝑧 = (𝐹‘𝑐) → (({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), 𝑧} ∈ (Edg‘𝐻)) ↔ ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻))))
86	80, 85	3anbi13d 1441	. . . . . . . . 9 ⊢ (𝑧 = (𝐹‘𝑐) → (((𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), 𝑧} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), 𝑧} ∈ (Edg‘𝐻))) ↔ ((𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))))
87	70, 78, 86	rspc3ev 3594	. . . . . . . 8 ⊢ ((((𝐹‘𝑎) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑏) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑐) ∈ (Vtx‘𝐻)) ∧ ((𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)))) → ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻))))
88	87	3exp2 1356	. . . . . . 7 ⊢ (((𝐹‘𝑎) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑏) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑐) ∈ (Vtx‘𝐻)) → ((𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)} → ((♯‘(𝐹 “ 𝑇)) = 3 → (({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)) → ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻)))))))
89	88	3imp 1111	. . . . . 6 ⊢ ((((𝐹‘𝑎) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑏) ∈ (Vtx‘𝐻) ∧ (𝐹‘𝑐) ∈ (Vtx‘𝐻)) ∧ (𝐹 “ 𝑇) = {(𝐹‘𝑎), (𝐹‘𝑏), (𝐹‘𝑐)} ∧ (♯‘(𝐹 “ 𝑇)) = 3) → (({(𝐹‘𝑎), (𝐹‘𝑏)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑎), (𝐹‘𝑐)} ∈ (Edg‘𝐻) ∧ {(𝐹‘𝑏), (𝐹‘𝑐)} ∈ (Edg‘𝐻)) → ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻)))))
90	23, 62, 89	sylc 65	. . . . 5 ⊢ ((((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) ∧ 𝑐 ∈ (Vtx‘𝐺)) ∧ (𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺)))) → ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻))))
91	90	rexlimdva2 3140	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ (Vtx‘𝐺) ∧ 𝑏 ∈ (Vtx‘𝐺))) → (∃𝑐 ∈ (Vtx‘𝐺)(𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))) → ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻)))))
92	91	rexlimdvva 3194	. . 3 ⊢ (𝜑 → (∃𝑎 ∈ (Vtx‘𝐺)∃𝑏 ∈ (Vtx‘𝐺)∃𝑐 ∈ (Vtx‘𝐺)(𝑇 = {𝑎, 𝑏, 𝑐} ∧ (♯‘𝑇) = 3 ∧ ({𝑎, 𝑏} ∈ (Edg‘𝐺) ∧ {𝑎, 𝑐} ∈ (Edg‘𝐺) ∧ {𝑏, 𝑐} ∈ (Edg‘𝐺))) → ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻)))))
93	5, 92	mpd 15	. 2 ⊢ (𝜑 → ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻))))
94	7, 26	isgrtri 48225	. 2 ⊢ ((𝐹 “ 𝑇) ∈ (GrTriangles‘𝐻) ↔ ∃𝑥 ∈ (Vtx‘𝐻)∃𝑦 ∈ (Vtx‘𝐻)∃𝑧 ∈ (Vtx‘𝐻)((𝐹 “ 𝑇) = {𝑥, 𝑦, 𝑧} ∧ (♯‘(𝐹 “ 𝑇)) = 3 ∧ ({𝑥, 𝑦} ∈ (Edg‘𝐻) ∧ {𝑥, 𝑧} ∈ (Edg‘𝐻) ∧ {𝑦, 𝑧} ∈ (Edg‘𝐻))))
95	93, 94	sylibr 234	1 ⊢ (𝜑 → (𝐹 “ 𝑇) ∈ (GrTriangles‘𝐻))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 ⊆ wss 3902 {cpr 4583 {ctp 4585 “ cima 5628 Fn wfn 6488 –1-1→wf1 6490 –1-1-onto→wf1o 6492 ‘cfv 6493 (class class class)co 7360 3c3 12205 ♯chash 14257 Vtxcvtx 29052 Edgcedg 29103 UHGraphcuhgr 29112 GraphIso cgrim 48157 GrTrianglescgrtri 48219

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-3o 8401 df-oadd 8403 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9817 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-3 12213 df-n0 12406 df-xnn0 12479 df-z 12493 df-uz 12756 df-fz 13428 df-fzo 13575 df-hash 14258 df-edg 29104 df-uhgr 29114 df-grim 48160 df-grtri 48220

This theorem is referenced by: usgrexmpl12ngric 48320

W3C validator