Theorem upgrreslem 29321

Description: Lemma for upgrres 29323. (Contributed by AV, 27-Nov-2020.) (Revised by AV, 19-Dec-2021.)

Hypotheses

Ref	Expression
upgrres.v	⊢ 𝑉 = (Vtx‘𝐺)
upgrres.e	⊢ 𝐸 = (iEdg‘𝐺)
upgrres.f	⊢ 𝐹 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}

Assertion

Ref	Expression
upgrreslem	⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ran (𝐸 ↾ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})

Distinct variable groups:   𝑖,𝐸   𝐸,𝑝   𝐺,𝑝   𝑖,𝑁   𝑁,𝑝   𝑉,𝑝

Allowed substitution hints:   𝐹(𝑖,𝑝)   𝐺(𝑖)   𝑉(𝑖)

Proof of Theorem upgrreslem

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ima 5698	. 2 ⊢ (𝐸 “ 𝐹) = ran (𝐸 ↾ 𝐹)
2		fveq2 6906	. . . . . . 7 ⊢ (𝑖 = 𝑗 → (𝐸‘𝑖) = (𝐸‘𝑗))
3		neleq2 3053	. . . . . . 7 ⊢ ((𝐸‘𝑖) = (𝐸‘𝑗) → (𝑁 ∉ (𝐸‘𝑖) ↔ 𝑁 ∉ (𝐸‘𝑗)))
4	2, 3	syl 17	. . . . . 6 ⊢ (𝑖 = 𝑗 → (𝑁 ∉ (𝐸‘𝑖) ↔ 𝑁 ∉ (𝐸‘𝑗)))
5		upgrres.f	. . . . . 6 ⊢ 𝐹 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}
6	4, 5	elrab2 3695	. . . . 5 ⊢ (𝑗 ∈ 𝐹 ↔ (𝑗 ∈ dom 𝐸 ∧ 𝑁 ∉ (𝐸‘𝑗)))
7		upgrres.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
8		upgrres.e	. . . . . . . 8 ⊢ 𝐸 = (iEdg‘𝐺)
9	7, 8	upgrf 29103	. . . . . . 7 ⊢ (𝐺 ∈ UPGraph → 𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
10		ffvelcdm 7101	. . . . . . . . . 10 ⊢ ((𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ∧ 𝑗 ∈ dom 𝐸) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
11		fveq2 6906	. . . . . . . . . . . . 13 ⊢ (𝑝 = (𝐸‘𝑗) → (♯‘𝑝) = (♯‘(𝐸‘𝑗)))
12	11	breq1d 5153	. . . . . . . . . . . 12 ⊢ (𝑝 = (𝐸‘𝑗) → ((♯‘𝑝) ≤ 2 ↔ (♯‘(𝐸‘𝑗)) ≤ 2))
13	12	elrab 3692	. . . . . . . . . . 11 ⊢ ((𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2))
14		eldifsn 4786	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ↔ ((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ (𝐸‘𝑗) ≠ ∅))
15		simpl 482	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 𝑉)
16		elpwi 4607	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐸‘𝑗) ∈ 𝒫 𝑉 → (𝐸‘𝑗) ⊆ 𝑉)
17	16	adantr 480	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ⊆ 𝑉)
18		simpr 484	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → 𝑁 ∉ (𝐸‘𝑗))
19		elpwdifsn 4789	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ (𝐸‘𝑗) ⊆ 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
20	15, 17, 18, 19	syl3anc 1373	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
21	20	ex 412	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐸‘𝑗) ∈ 𝒫 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
22	21	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ (𝐸‘𝑗) ≠ ∅) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
23	14, 22	sylbi 217	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
24	23	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
25	24	imp 406	. . . . . . . . . . . . . . 15 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
26		eldifsni 4790	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑗) ≠ ∅)
27	26	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝐸‘𝑗) ≠ ∅)
28	27	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ≠ ∅)
29		eldifsn 4786	. . . . . . . . . . . . . . 15 ⊢ ((𝐸‘𝑗) ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ↔ ((𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}) ∧ (𝐸‘𝑗) ≠ ∅))
30	25, 28, 29	sylanbrc 583	. . . . . . . . . . . . . 14 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}))
31		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (♯‘(𝐸‘𝑗)) ≤ 2)
32	31	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (♯‘(𝐸‘𝑗)) ≤ 2)
33	12, 30, 32	elrabd 3694	. . . . . . . . . . . . 13 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
34	33	ex 412	. . . . . . . . . . . 12 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
35	34	a1d 25	. . . . . . . . . . 11 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝑁 ∈ 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
36	13, 35	sylbi 217	. . . . . . . . . 10 ⊢ ((𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} → (𝑁 ∈ 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
37	10, 36	syl 17	. . . . . . . . 9 ⊢ ((𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ∧ 𝑗 ∈ dom 𝐸) → (𝑁 ∈ 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
38	37	ex 412	. . . . . . . 8 ⊢ (𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} → (𝑗 ∈ dom 𝐸 → (𝑁 ∈ 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))))
39	38	com23 86	. . . . . . 7 ⊢ (𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} → (𝑁 ∈ 𝑉 → (𝑗 ∈ dom 𝐸 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))))
40	9, 39	syl 17	. . . . . 6 ⊢ (𝐺 ∈ UPGraph → (𝑁 ∈ 𝑉 → (𝑗 ∈ dom 𝐸 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))))
41	40	imp4b 421	. . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐸 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
42	6, 41	biimtrid 242	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝑗 ∈ 𝐹 → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
43	42	ralrimiv 3145	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑗 ∈ 𝐹 (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
44		upgruhgr 29119	. . . . . 6 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
45	8	uhgrfun 29083	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸)
46	44, 45	syl 17	. . . . 5 ⊢ (𝐺 ∈ UPGraph → Fun 𝐸)
47	46	adantr 480	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → Fun 𝐸)
48	5	ssrab3 4082	. . . 4 ⊢ 𝐹 ⊆ dom 𝐸
49		funimass4 6973	. . . 4 ⊢ ((Fun 𝐸 ∧ 𝐹 ⊆ dom 𝐸) → ((𝐸 “ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ∀𝑗 ∈ 𝐹 (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
50	47, 48, 49	sylancl 586	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ((𝐸 “ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ∀𝑗 ∈ 𝐹 (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
51	43, 50	mpbird 257	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝐸 “ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
52	1, 51	eqsstrrid 4023	1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ran (𝐸 ↾ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108   ≠ wne 2940   ∉ wnel 3046  ∀wral 3061  {crab 3436   ∖ cdif 3948   ⊆ wss 3951  ∅c0 4333  𝒫 cpw 4600  {csn 4626   class class class wbr 5143  dom cdm 5685  ran crn 5686   ↾ cres 5687   “ cima 5688  Fun wfun 6555  ⟶wf 6557  ‘cfv 6561   ≤ cle 11296  2c2 12321  ♯chash 14369  Vtxcvtx 29013  iEdgciedg 29014  UHGraphcuhgr 29073  UPGraphcupgr 29097

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-fv 6569  df-uhgr 29075  df-upgr 29099

This theorem is referenced by:  upgrres  29323