Theorem bj-restuni 37063

Description: The union of an elementwise intersection by a set is equal to the intersection with that set of the union of the family. See also restuni 23191 and restuni2 23196. (Contributed by BJ, 27-Apr-2021.)

Assertion

Ref	Expression
bj-restuni	⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ∪ (𝑋 ↾t 𝐴) = (∪ 𝑋 ∩ 𝐴))

Proof of Theorem bj-restuni

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluni 4934	. . 3 ⊢ (𝑥 ∈ ∪ (𝑋 ↾t 𝐴) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)))
2		elrest 17487	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑦 ∈ (𝑋 ↾t 𝐴) ↔ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)))
3	2	anbi2d 629	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)) ↔ (𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴))))
4	3	exbidv 1920	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴))))
5		eluni 4934	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ 𝑋 ↔ ∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋))
6	5	bicomi 224	. . . . . . 7 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ↔ 𝑥 ∈ ∪ 𝑋)
7	6	anbi1i 623	. . . . . 6 ⊢ ((∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ ∪ 𝑋 ∧ 𝑥 ∈ 𝐴))
8	7	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ ∪ 𝑋 ∧ 𝑥 ∈ 𝐴)))
9		df-rex 3077	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴) ↔ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴)))
10	9	anbi2i 622	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ 𝑦 ∧ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
11		19.42v 1953	. . . . . . . . 9 ⊢ (∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (𝑥 ∈ 𝑦 ∧ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
12	11	bicomi 224	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑦 ∧ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
13	10, 12	bitri 275	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ ∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
14	13	exbii 1846	. . . . . 6 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ ∃𝑦∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
15		excom 2163	. . . . . 6 ⊢ (∃𝑦∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑧∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
16		an12 644	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
17	16	exbii 1846	. . . . . . . . 9 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑦(𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
18		19.42v 1953	. . . . . . . . 9 ⊢ (∃𝑦(𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (𝑧 ∈ 𝑋 ∧ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
19		eqimss 4067	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → 𝑦 ⊆ (𝑧 ∩ 𝐴))
20	19	sseld 4007	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → (𝑥 ∈ 𝑦 → 𝑥 ∈ (𝑧 ∩ 𝐴)))
21	20	imdistanri 569	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) → (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)))
22		eqimss2 4068	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → (𝑧 ∩ 𝐴) ⊆ 𝑦)
23	22	sseld 4007	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → (𝑥 ∈ (𝑧 ∩ 𝐴) → 𝑥 ∈ 𝑦))
24	23	imdistanri 569	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)) → (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)))
25	21, 24	impbii 209	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)))
26	25	exbii 1846	. . . . . . . . . . 11 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ ∃𝑦(𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)))
27		19.42v 1953	. . . . . . . . . . 11 ⊢ (∃𝑦(𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)))
28		vex 3492	. . . . . . . . . . . . . . . 16 ⊢ 𝑧 ∈ V
29	28	inex1 5335	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∩ 𝐴) ∈ V
30	29	isseti 3506	. . . . . . . . . . . . . 14 ⊢ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)
31	30	biantru 529	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (𝑧 ∩ 𝐴) ↔ (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)))
32	31	bicomi 224	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)) ↔ 𝑥 ∈ (𝑧 ∩ 𝐴))
33		elin 3992	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑧 ∩ 𝐴) ↔ (𝑥 ∈ 𝑧 ∧ 𝑥 ∈ 𝐴))
34	32, 33	bitri 275	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ 𝑧 ∧ 𝑥 ∈ 𝐴))
35	26, 27, 34	3bitri 297	. . . . . . . . . 10 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ 𝑧 ∧ 𝑥 ∈ 𝐴))
36	35	bianassc 642	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝑋 ∧ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
37	17, 18, 36	3bitri 297	. . . . . . . 8 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
38	37	exbii 1846	. . . . . . 7 ⊢ (∃𝑧∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑧((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
39		19.41v 1949	. . . . . . 7 ⊢ (∃𝑧((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
40	38, 39	bitri 275	. . . . . 6 ⊢ (∃𝑧∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
41	14, 15, 40	3bitri 297	. . . . 5 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
42		elin 3992	. . . . 5 ⊢ (𝑥 ∈ (∪ 𝑋 ∩ 𝐴) ↔ (𝑥 ∈ ∪ 𝑋 ∧ 𝑥 ∈ 𝐴))
43	8, 41, 42	3bitr4g 314	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ 𝑥 ∈ (∪ 𝑋 ∩ 𝐴)))
44	4, 43	bitrd 279	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)) ↔ 𝑥 ∈ (∪ 𝑋 ∩ 𝐴)))
45	1, 44	bitrid 283	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ ∪ (𝑋 ↾t 𝐴) ↔ 𝑥 ∈ (∪ 𝑋 ∩ 𝐴)))
46	45	eqrdv 2738	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ∪ (𝑋 ↾t 𝐴) = (∪ 𝑋 ∩ 𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108  ∃wrex 3076   ∩ cin 3975  ∪ cuni 4931  (class class class)co 7448   ↾_t crest 17480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-rest 17482

This theorem is referenced by:  bj-restuni2  37064