Theorem upgrun 26013

Description: The union 𝑈 of two pseudographs 𝐺 and 𝐻 with the same vertex set 𝑉 is a pseudograph with the vertex 𝑉 and the union (𝐸 ∪ 𝐹) of the (indexed) edges. (Contributed by AV, 12-Oct-2020.) (Revised by AV, 24-Oct-2021.)

Hypotheses

Ref	Expression
upgrun.g	⊢ (𝜑 → 𝐺 ∈ UPGraph )
upgrun.h	⊢ (𝜑 → 𝐻 ∈ UPGraph )
upgrun.e	⊢ 𝐸 = (iEdg‘𝐺)
upgrun.f	⊢ 𝐹 = (iEdg‘𝐻)
upgrun.vg	⊢ 𝑉 = (Vtx‘𝐺)
upgrun.vh	⊢ (𝜑 → (Vtx‘𝐻) = 𝑉)
upgrun.i	⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)
upgrun.u	⊢ (𝜑 → 𝑈 ∈ 𝑊)
upgrun.v	⊢ (𝜑 → (Vtx‘𝑈) = 𝑉)
upgrun.un	⊢ (𝜑 → (iEdg‘𝑈) = (𝐸 ∪ 𝐹))

Assertion

Ref	Expression
upgrun	⊢ (𝜑 → 𝑈 ∈ UPGraph )

Proof of Theorem upgrun

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		upgrun.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ UPGraph )
2		upgrun.vg	. . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺)
3		upgrun.e	. . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺)
4	2, 3	upgrf 25981	. . . . 5 ⊢ (𝐺 ∈ UPGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
5	1, 4	syl 17	. . . 4 ⊢ (𝜑 → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
6		upgrun.h	. . . . . 6 ⊢ (𝜑 → 𝐻 ∈ UPGraph )
7		eqid 2622	. . . . . . 7 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
8		upgrun.f	. . . . . . 7 ⊢ 𝐹 = (iEdg‘𝐻)
9	7, 8	upgrf 25981	. . . . . 6 ⊢ (𝐻 ∈ UPGraph → 𝐹:dom 𝐹⟶{𝑥 ∈ (𝒫 (Vtx‘𝐻) ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
10	6, 9	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹:dom 𝐹⟶{𝑥 ∈ (𝒫 (Vtx‘𝐻) ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
11		upgrun.vh	. . . . . . . . . 10 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉)
12	11	eqcomd 2628	. . . . . . . . 9 ⊢ (𝜑 → 𝑉 = (Vtx‘𝐻))
13	12	pweqd 4163	. . . . . . . 8 ⊢ (𝜑 → 𝒫 𝑉 = 𝒫 (Vtx‘𝐻))
14	13	difeq1d 3727	. . . . . . 7 ⊢ (𝜑 → (𝒫 𝑉 ∖ {∅}) = (𝒫 (Vtx‘𝐻) ∖ {∅}))
15	14	rabeqdv 3194	. . . . . 6 ⊢ (𝜑 → {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} = {𝑥 ∈ (𝒫 (Vtx‘𝐻) ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
16	15	feq3d 6032	. . . . 5 ⊢ (𝜑 → (𝐹:dom 𝐹⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ 𝐹:dom 𝐹⟶{𝑥 ∈ (𝒫 (Vtx‘𝐻) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
17	10, 16	mpbird 247	. . . 4 ⊢ (𝜑 → 𝐹:dom 𝐹⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
18		upgrun.i	. . . 4 ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)
19	5, 17, 18	fun2d 6068	. . 3 ⊢ (𝜑 → (𝐸 ∪ 𝐹):(dom 𝐸 ∪ dom 𝐹)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
20		upgrun.un	. . . 4 ⊢ (𝜑 → (iEdg‘𝑈) = (𝐸 ∪ 𝐹))
21	20	dmeqd 5326	. . . . 5 ⊢ (𝜑 → dom (iEdg‘𝑈) = dom (𝐸 ∪ 𝐹))
22		dmun 5331	. . . . 5 ⊢ dom (𝐸 ∪ 𝐹) = (dom 𝐸 ∪ dom 𝐹)
23	21, 22	syl6eq 2672	. . . 4 ⊢ (𝜑 → dom (iEdg‘𝑈) = (dom 𝐸 ∪ dom 𝐹))
24		upgrun.v	. . . . . . 7 ⊢ (𝜑 → (Vtx‘𝑈) = 𝑉)
25	24	pweqd 4163	. . . . . 6 ⊢ (𝜑 → 𝒫 (Vtx‘𝑈) = 𝒫 𝑉)
26	25	difeq1d 3727	. . . . 5 ⊢ (𝜑 → (𝒫 (Vtx‘𝑈) ∖ {∅}) = (𝒫 𝑉 ∖ {∅}))
27	26	rabeqdv 3194	. . . 4 ⊢ (𝜑 → {𝑥 ∈ (𝒫 (Vtx‘𝑈) ∖ {∅}) ∣ (#‘𝑥) ≤ 2} = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
28	20, 23, 27	feq123d 6034	. . 3 ⊢ (𝜑 → ((iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ (𝒫 (Vtx‘𝑈) ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ↔ (𝐸 ∪ 𝐹):(dom 𝐸 ∪ dom 𝐹)⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
29	19, 28	mpbird 247	. 2 ⊢ (𝜑 → (iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ (𝒫 (Vtx‘𝑈) ∖ {∅}) ∣ (#‘𝑥) ≤ 2})
30		upgrun.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑊)
31		eqid 2622	. . . 4 ⊢ (Vtx‘𝑈) = (Vtx‘𝑈)
32		eqid 2622	. . . 4 ⊢ (iEdg‘𝑈) = (iEdg‘𝑈)
33	31, 32	isupgr 25979	. . 3 ⊢ (𝑈 ∈ 𝑊 → (𝑈 ∈ UPGraph ↔ (iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ (𝒫 (Vtx‘𝑈) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
34	30, 33	syl 17	. 2 ⊢ (𝜑 → (𝑈 ∈ UPGraph ↔ (iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ (𝒫 (Vtx‘𝑈) ∖ {∅}) ∣ (#‘𝑥) ≤ 2}))
35	29, 34	mpbird 247	1 ⊢ (𝜑 → 𝑈 ∈ UPGraph )

Syntax hints:   → wi 4   ↔ wb 196   = wceq 1483   ∈ wcel 1990  {crab 2916   ∖ cdif 3571   ∪ cun 3572   ∩ cin 3573  ∅c0 3915  𝒫 cpw 4158  {csn 4177   class class class wbr 4653  dom cdm 5114  ⟶wf 5884  ‘cfv 5888   ≤ cle 10075  2c2 11070  #chash 13117  Vtxcvtx 25874  iEdgciedg 25875   UPGraph cupgr 25975

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-upgr 25977

This theorem is referenced by:  upgrunop  26014  uspgrun  26080