Theorem upgrreslem 28561

Description: Lemma for upgrres 28563. (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 5690	. 2 ⊢ (𝐸 “ 𝐹) = ran (𝐸 ↾ 𝐹)
2		fveq2 6892	. . . . . . 7 ⊢ (𝑖 = 𝑗 → (𝐸‘𝑖) = (𝐸‘𝑗))
3		neleq2 3054	. . . . . . 7 ⊢ ((𝐸‘𝑖) = (𝐸‘𝑗) → (𝑁 ∉ (𝐸‘𝑖) ↔ 𝑁 ∉ (𝐸‘𝑗)))
4	2, 3	syl 17	. . . . . 6 ⊢ (𝑖 = 𝑗 → (𝑁 ∉ (𝐸‘𝑖) ↔ 𝑁 ∉ (𝐸‘𝑗)))
5		upgrres.f	. . . . . 6 ⊢ 𝐹 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}
6	4, 5	elrab2 3687	. . . . 5 ⊢ (𝑗 ∈ 𝐹 ↔ (𝑗 ∈ dom 𝐸 ∧ 𝑁 ∉ (𝐸‘𝑗)))
7		upgrres.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
8		upgrres.e	. . . . . . . 8 ⊢ 𝐸 = (iEdg‘𝐺)
9	7, 8	upgrf 28346	. . . . . . 7 ⊢ (𝐺 ∈ UPGraph → 𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
10		ffvelcdm 7084	. . . . . . . . . 10 ⊢ ((𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ∧ 𝑗 ∈ dom 𝐸) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
11		fveq2 6892	. . . . . . . . . . . . 13 ⊢ (𝑝 = (𝐸‘𝑗) → (♯‘𝑝) = (♯‘(𝐸‘𝑗)))
12	11	breq1d 5159	. . . . . . . . . . . 12 ⊢ (𝑝 = (𝐸‘𝑗) → ((♯‘𝑝) ≤ 2 ↔ (♯‘(𝐸‘𝑗)) ≤ 2))
13	12	elrab 3684	. . . . . . . . . . 11 ⊢ ((𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2))
14		eldifsn 4791	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ↔ ((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ (𝐸‘𝑗) ≠ ∅))
15		simpl 484	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 𝑉)
16		elpwi 4610	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐸‘𝑗) ∈ 𝒫 𝑉 → (𝐸‘𝑗) ⊆ 𝑉)
17	16	adantr 482	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ⊆ 𝑉)
18		simpr 486	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → 𝑁 ∉ (𝐸‘𝑗))
19		elpwdifsn 4793	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ (𝐸‘𝑗) ⊆ 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
20	15, 17, 18, 19	syl3anc 1372	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
21	20	ex 414	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐸‘𝑗) ∈ 𝒫 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
22	21	adantr 482	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐸‘𝑗) ∈ 𝒫 𝑉 ∧ (𝐸‘𝑗) ≠ ∅) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
23	14, 22	sylbi 216	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
24	23	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
25	24	imp 408	. . . . . . . . . . . . . . 15 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
26		eldifsni 4794	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝑗) ≠ ∅)
27	26	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝐸‘𝑗) ≠ ∅)
28	27	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ≠ ∅)
29		eldifsn 4791	. . . . . . . . . . . . . . 15 ⊢ ((𝐸‘𝑗) ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ↔ ((𝐸‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}) ∧ (𝐸‘𝑗) ≠ ∅))
30	25, 28, 29	sylanbrc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}))
31		simpr 486	. . . . . . . . . . . . . . 15 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (♯‘(𝐸‘𝑗)) ≤ 2)
32	31	adantr 482	. . . . . . . . . . . . . 14 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (♯‘(𝐸‘𝑗)) ≤ 2)
33	12, 30, 32	elrabd 3686	. . . . . . . . . . . . 13 ⊢ ((((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
34	33	ex 414	. . . . . . . . . . . 12 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
35	34	a1d 25	. . . . . . . . . . 11 ⊢ (((𝐸‘𝑗) ∈ (𝒫 𝑉 ∖ {∅}) ∧ (♯‘(𝐸‘𝑗)) ≤ 2) → (𝑁 ∈ 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
36	13, 35	sylbi 216	. . . . . . . . . 10 ⊢ ((𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} → (𝑁 ∈ 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
37	10, 36	syl 17	. . . . . . . . 9 ⊢ ((𝐸:dom 𝐸⟶{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ∧ 𝑗 ∈ dom 𝐸) → (𝑁 ∈ 𝑉 → (𝑁 ∉ (𝐸‘𝑗) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
38	37	ex 414	. . . . . . . 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 423	. . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐸 ∧ 𝑁 ∉ (𝐸‘𝑗)) → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
42	6, 41	biimtrid 241	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝑗 ∈ 𝐹 → (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
43	42	ralrimiv 3146	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑗 ∈ 𝐹 (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
44		upgruhgr 28362	. . . . . 6 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
45	8	uhgrfun 28326	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸)
46	44, 45	syl 17	. . . . 5 ⊢ (𝐺 ∈ UPGraph → Fun 𝐸)
47	46	adantr 482	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → Fun 𝐸)
48	5	ssrab3 4081	. . . 4 ⊢ 𝐹 ⊆ dom 𝐸
49		funimass4 6957	. . . 4 ⊢ ((Fun 𝐸 ∧ 𝐹 ⊆ dom 𝐸) → ((𝐸 “ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ∀𝑗 ∈ 𝐹 (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
50	47, 48, 49	sylancl 587	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ((𝐸 “ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ∀𝑗 ∈ 𝐹 (𝐸‘𝑗) ∈ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
51	43, 50	mpbird 257	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (𝐸 “ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
52	1, 51	eqsstrrid 4032	1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ran (𝐸 ↾ 𝐹) ⊆ {𝑝 ∈ (𝒫 (𝑉 ∖ {𝑁}) ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542   ∈ wcel 2107   ≠ wne 2941   ∉ wnel 3047  ∀wral 3062  {crab 3433   ∖ cdif 3946   ⊆ wss 3949  ∅c0 4323  𝒫 cpw 4603  {csn 4629   class class class wbr 5149  dom cdm 5677  ran crn 5678   ↾ cres 5679   “ cima 5680  Fun wfun 6538  ⟶wf 6540  ‘cfv 6544   ≤ cle 11249  2c2 12267  ♯chash 14290  Vtxcvtx 28256  iEdgciedg 28257  UHGraphcuhgr 28316  UPGraphcupgr 28340

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-sbc 3779  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-fv 6552  df-uhgr 28318  df-upgr 28342

This theorem is referenced by:  upgrres  28563