Theorem bj-restuni 37986

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 23460 and restuni2 23465. (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 4870	. . 3 ⊢ (𝑥 ∈ ∪ (𝑋 ↾t 𝐴) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)))
2		elrest 17578	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑦 ∈ (𝑋 ↾t 𝐴) ↔ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)))
3	2	anbi2d 642	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)) ↔ (𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴))))
4	3	exbidv 1954	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴))))
5		eluni 4870	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ 𝑋 ↔ ∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋))
6	5	bicomi 227	. . . . . . 7 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ↔ 𝑥 ∈ ∪ 𝑋)
7	6	anbi1i 636	. . . . . 6 ⊢ ((∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ ∪ 𝑋 ∧ 𝑥 ∈ 𝐴))
8	7	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ((∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ ∪ 𝑋 ∧ 𝑥 ∈ 𝐴)))
9		df-rex 3088	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴) ↔ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴)))
10	9	anbi2i 635	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ 𝑦 ∧ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
11		19.42v 1986	. . . . . . . . 9 ⊢ (∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (𝑥 ∈ 𝑦 ∧ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
12	11	bicomi 227	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑦 ∧ ∃𝑧(𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
13	10, 12	bitri 278	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ ∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
14	13	exbii 1881	. . . . . 6 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ ∃𝑦∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
15		excom 2199	. . . . . 6 ⊢ (∃𝑦∃𝑧(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑧∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
16		an12 658	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
17	16	exbii 1881	. . . . . . . . 9 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑦(𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
18		19.42v 1986	. . . . . . . . 9 ⊢ (∃𝑦(𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (𝑧 ∈ 𝑋 ∧ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))))
19		eqimss 3989	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → 𝑦 ⊆ (𝑧 ∩ 𝐴))
20	19	sseld 3930	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → (𝑥 ∈ 𝑦 → 𝑥 ∈ (𝑧 ∩ 𝐴)))
21	20	imdistanri 580	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) → (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)))
22		eqimss2 3990	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → (𝑧 ∩ 𝐴) ⊆ 𝑦)
23	22	sseld 3930	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑧 ∩ 𝐴) → (𝑥 ∈ (𝑧 ∩ 𝐴) → 𝑥 ∈ 𝑦))
24	23	imdistanri 580	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)) → (𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)))
25	21, 24	impbii 212	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)))
26	25	exbii 1881	. . . . . . . . . . 11 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ ∃𝑦(𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)))
27		19.42v 1986	. . . . . . . . . . 11 ⊢ (∃𝑦(𝑥 ∈ (𝑧 ∩ 𝐴) ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)))
28		vex 3455	. . . . . . . . . . . . . . . 16 ⊢ 𝑧 ∈ V
29	28	inex1 5277	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∩ 𝐴) ∈ V
30	29	isseti 3469	. . . . . . . . . . . . . 14 ⊢ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)
31	30	biantru 539	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (𝑧 ∩ 𝐴) ↔ (𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)))
32	31	bicomi 227	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)) ↔ 𝑥 ∈ (𝑧 ∩ 𝐴))
33		elin 3915	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑧 ∩ 𝐴) ↔ (𝑥 ∈ 𝑧 ∧ 𝑥 ∈ 𝐴))
34	32, 33	bitri 278	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ (𝑧 ∩ 𝐴) ∧ ∃𝑦 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ 𝑧 ∧ 𝑥 ∈ 𝐴))
35	26, 27, 34	3bitri 300	. . . . . . . . . 10 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴)) ↔ (𝑥 ∈ 𝑧 ∧ 𝑥 ∈ 𝐴))
36	35	bianassc 656	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝑋 ∧ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
37	17, 18, 36	3bitri 300	. . . . . . . 8 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
38	37	exbii 1881	. . . . . . 7 ⊢ (∃𝑧∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ ∃𝑧((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
39		19.41v 1982	. . . . . . 7 ⊢ (∃𝑧((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
40	38, 39	bitri 278	. . . . . 6 ⊢ (∃𝑧∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑧 ∈ 𝑋 ∧ 𝑦 = (𝑧 ∩ 𝐴))) ↔ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
41	14, 15, 40	3bitri 300	. . . . 5 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝐴))
42		elin 3915	. . . . 5 ⊢ (𝑥 ∈ (∪ 𝑋 ∩ 𝐴) ↔ (𝑥 ∈ ∪ 𝑋 ∧ 𝑥 ∈ 𝐴))
43	8, 41, 42	3bitr4g 317	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑦(𝑥 ∈ 𝑦 ∧ ∃𝑧 ∈ 𝑋 𝑦 = (𝑧 ∩ 𝐴)) ↔ 𝑥 ∈ (∪ 𝑋 ∩ 𝐴)))
44	4, 43	bitrd 282	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝑋 ↾t 𝐴)) ↔ 𝑥 ∈ (∪ 𝑋 ∩ 𝐴)))
45	1, 44	bitrid 286	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ ∪ (𝑋 ↾t 𝐴) ↔ 𝑥 ∈ (∪ 𝑋 ∩ 𝐴)))
46	45	eqrdv 2759	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → ∪ (𝑋 ↾t 𝐴) = (∪ 𝑋 ∩ 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087   ∩ cin 3898  ∪ cuni 4867  (class class class)co 7412   ↾_t crest 17571

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-rest 17573

This theorem is used by:  bj-restuni2  37987