Theorem grlimgrtrilem2 49373

Description: Lemma 3 for grlimgrtri 49374. (Contributed by AV, 23-Aug-2025.)

Hypotheses

Ref	Expression
grlimgrtrilem1.v	⊢ 𝑉 = (Vtx‘𝐺)
grlimgrtrilem1.n	⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑎)
grlimgrtrilem1.i	⊢ 𝐼 = (Edg‘𝐺)
grlimgrtrilem1.k	⊢ 𝐾 = {𝑥 ∈ 𝐼 ∣ 𝑥 ⊆ 𝑁}
grlimgrtrilem2.m	⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑎))
grlimgrtrilem2.j	⊢ 𝐽 = (Edg‘𝐻)
grlimgrtrilem2.l	⊢ 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}

Assertion

Ref	Expression
grlimgrtrilem2	⊢ (((𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿) ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ 𝑖) = (𝑔‘𝑖) ∧ {𝑏, 𝑐} ∈ 𝐾) → {(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽)

Distinct variable groups:   𝑥,𝐼   𝑥,𝑁   𝑥,𝑎   𝑥,𝑏   𝑥,𝑐   𝑥,𝐽   𝑖,𝐾   𝑖,𝑏   𝑖,𝑐   𝑓,𝑖   𝑔,𝑖

Allowed substitution hints:   𝐹(𝑥, 𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝐺(𝑥, 𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝐻(𝑥, 𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝐼(𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝐽(𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝐾(𝑥, 𝑓, 𝑔, 𝑎, 𝑏, 𝑐)   𝐿(𝑥, 𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝑀(𝑥, 𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝑁(𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)   𝑉(𝑥, 𝑓, 𝑔, 𝑖, 𝑎, 𝑏, 𝑐)

Proof of Theorem grlimgrtrilem2

Step	Hyp	Ref	Expression
1		imaeq2 6066	. . . . 5 ⊢ (𝑖 = {𝑏, 𝑐} → (𝑓 “ 𝑖) = (𝑓 “ {𝑏, 𝑐}))
2		fveq2 6916	. . . . 5 ⊢ (𝑖 = {𝑏, 𝑐} → (𝑔‘𝑖) = (𝑔‘{𝑏, 𝑐}))
3	1, 2	eqeq12d 2779	. . . 4 ⊢ (𝑖 = {𝑏, 𝑐} → ((𝑓 “ 𝑖) = (𝑔‘𝑖) ↔ (𝑓 “ {𝑏, 𝑐}) = (𝑔‘{𝑏, 𝑐})))
4	3	rspcv 3576	. . 3 ⊢ ({𝑏, 𝑐} ∈ 𝐾 → (∀𝑖 ∈ 𝐾 (𝑓 “ 𝑖) = (𝑔‘𝑖) → (𝑓 “ {𝑏, 𝑐}) = (𝑔‘{𝑏, 𝑐})))
5		f1ofn 6855	. . . . . . . . . 10 ⊢ (𝑓:𝑁⟶1-1onto𝑀 → 𝑓 Fn 𝑁)
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿) → 𝑓 Fn 𝑁)
7	6	adantl 487	. . . . . . . 8 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → 𝑓 Fn 𝑁)
8		grlimgrtrilem1.k	. . . . . . . . . . . 12 ⊢ 𝐾 = {𝑥 ∈ 𝐼 ∣ 𝑥 ⊆ 𝑁}
9	8	eleq2i 2856	. . . . . . . . . . 11 ⊢ ({𝑏, 𝑐} ∈ 𝐾 ↔ {𝑏, 𝑐} ∈ {𝑥 ∈ 𝐼 ∣ 𝑥 ⊆ 𝑁})
10		sseq1 3938	. . . . . . . . . . . 12 ⊢ (𝑥 = {𝑏, 𝑐} → (𝑥 ⊆ 𝑁 ↔ {𝑏, 𝑐} ⊆ 𝑁))
11	10	elrab 3648	. . . . . . . . . . 11 ⊢ ({𝑏, 𝑐} ∈ {𝑥 ∈ 𝐼 ∣ 𝑥 ⊆ 𝑁} ↔ ({𝑏, 𝑐} ∈ 𝐼 ∧ {𝑏, 𝑐} ⊆ 𝑁))
12	9, 11	bitri 278	. . . . . . . . . 10 ⊢ ({𝑏, 𝑐} ∈ 𝐾 ↔ ({𝑏, 𝑐} ∈ 𝐼 ∧ {𝑏, 𝑐} ⊆ 𝑁))
13		vex 3458	. . . . . . . . . . . 12 ⊢ 𝑏 ∈ V
14		vex 3458	. . . . . . . . . . . 12 ⊢ 𝑐 ∈ V
15	13, 14	prss 4781	. . . . . . . . . . 11 ⊢ ((𝑏 ∈ 𝑁 ∧ 𝑐 ∈ 𝑁) ↔ {𝑏, 𝑐} ⊆ 𝑁)
16		simpl 488	. . . . . . . . . . 11 ⊢ ((𝑏 ∈ 𝑁 ∧ 𝑐 ∈ 𝑁) → 𝑏 ∈ 𝑁)
17	15, 16	sylbir 238	. . . . . . . . . 10 ⊢ ({𝑏, 𝑐} ⊆ 𝑁 → 𝑏 ∈ 𝑁)
18	12, 17	simplbiim 514	. . . . . . . . 9 ⊢ ({𝑏, 𝑐} ∈ 𝐾 → 𝑏 ∈ 𝑁)
19	18	adantr 486	. . . . . . . 8 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → 𝑏 ∈ 𝑁)
20		simpr 490	. . . . . . . . . . 11 ⊢ ((𝑏 ∈ 𝑁 ∧ 𝑐 ∈ 𝑁) → 𝑐 ∈ 𝑁)
21	15, 20	sylbir 238	. . . . . . . . . 10 ⊢ ({𝑏, 𝑐} ⊆ 𝑁 → 𝑐 ∈ 𝑁)
22	12, 21	simplbiim 514	. . . . . . . . 9 ⊢ ({𝑏, 𝑐} ∈ 𝐾 → 𝑐 ∈ 𝑁)
23	22	adantr 486	. . . . . . . 8 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → 𝑐 ∈ 𝑁)
24		fnimapr 6999	. . . . . . . 8 ⊢ ((𝑓 Fn 𝑁 ∧ 𝑏 ∈ 𝑁 ∧ 𝑐 ∈ 𝑁) → (𝑓 “ {𝑏, 𝑐}) = {(𝑓‘𝑏), (𝑓‘𝑐)})
25	7, 19, 23, 24	syl3anc 1399	. . . . . . 7 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → (𝑓 “ {𝑏, 𝑐}) = {(𝑓‘𝑏), (𝑓‘𝑐)})
26	25	eqeq1d 2765	. . . . . 6 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → ((𝑓 “ {𝑏, 𝑐}) = (𝑔‘{𝑏, 𝑐}) ↔ {(𝑓‘𝑏), (𝑓‘𝑐)} = (𝑔‘{𝑏, 𝑐})))
27		grlimgrtrilem2.l	. . . . . . . . 9 ⊢ 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}
28		ssrab2 4008	. . . . . . . . 9 ⊢ {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀} ⊆ 𝐽
29	27, 28	eqsstri 3959	. . . . . . . 8 ⊢ 𝐿 ⊆ 𝐽
30		f1of 6854	. . . . . . . . . . 11 ⊢ (𝑔:𝐾⟶1-1onto𝐿 → 𝑔:𝐾⟶𝐿)
31	30	adantl 487	. . . . . . . . . 10 ⊢ ((𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿) → 𝑔:𝐾⟶𝐿)
32	31	adantl 487	. . . . . . . . 9 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → 𝑔:𝐾⟶𝐿)
33		simpl 488	. . . . . . . . 9 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → {𝑏, 𝑐} ∈ 𝐾)
34	32, 33	ffvelcdmd 7117	. . . . . . . 8 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → (𝑔‘{𝑏, 𝑐}) ∈ 𝐿)
35	29, 34	sselid 3911	. . . . . . 7 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → (𝑔‘{𝑏, 𝑐}) ∈ 𝐽)
36		eleq1 2852	. . . . . . 7 ⊢ ({(𝑓‘𝑏), (𝑓‘𝑐)} = (𝑔‘{𝑏, 𝑐}) → ({(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽 ↔ (𝑔‘{𝑏, 𝑐}) ∈ 𝐽))
37	35, 36	syl5ibrcom 250	. . . . . 6 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → ({(𝑓‘𝑏), (𝑓‘𝑐)} = (𝑔‘{𝑏, 𝑐}) → {(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽))
38	26, 37	sylbid 243	. . . . 5 ⊢ (({𝑏, 𝑐} ∈ 𝐾 ∧ (𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿)) → ((𝑓 “ {𝑏, 𝑐}) = (𝑔‘{𝑏, 𝑐}) → {(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽))
39	38	ex 418	. . . 4 ⊢ ({𝑏, 𝑐} ∈ 𝐾 → ((𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿) → ((𝑓 “ {𝑏, 𝑐}) = (𝑔‘{𝑏, 𝑐}) → {(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽)))
40	39	com23 87	. . 3 ⊢ ({𝑏, 𝑐} ∈ 𝐾 → ((𝑓 “ {𝑏, 𝑐}) = (𝑔‘{𝑏, 𝑐}) → ((𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿) → {(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽)))
41	4, 40	syld 48	. 2 ⊢ ({𝑏, 𝑐} ∈ 𝐾 → (∀𝑖 ∈ 𝐾 (𝑓 “ 𝑖) = (𝑔‘𝑖) → ((𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿) → {(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽)))
42	41	3imp31 1129	1 ⊢ (((𝑓:𝑁⟶1-1onto𝑀 ∧ 𝑔:𝐾⟶1-1onto𝐿) ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ 𝑖) = (𝑔‘𝑖) ∧ {𝑏, 𝑐} ∈ 𝐾) → {(𝑓‘𝑏), (𝑓‘𝑐)} ∈ 𝐽)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900  {cpr 4590   “ cima 5661   Fn wfn 6561  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451  Vtxcvtx 29631  Edgcedg 29682   ClNeighbVtx cclnbgr 49189

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-f1o 6573  df-fv 6574

This theorem is used by:  grlimgrtri  49374