Theorem cover2 37416

Description: Two ways of expressing the statement "there is a cover of 𝐴 by elements of 𝐵 such that for each set in the cover, 𝜑". Note that 𝜑 and 𝑥 must be distinct. (Contributed by Jeff Madsen, 20-Jun-2010.)

Hypotheses

Ref	Expression
cover2.1	⊢ 𝐵 ∈ V
cover2.2	⊢ 𝐴 = ∪ 𝐵

Assertion

Ref	Expression
cover2	⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))

Distinct variable groups:   𝜑,𝑥,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐴,𝑧

Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑦)

Proof of Theorem cover2

Step	Hyp	Ref	Expression
1		cover2.1	. . . 4 ⊢ 𝐵 ∈ V
2		ssrab2 4076	. . . 4 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜑} ⊆ 𝐵
3	1, 2	elpwi2 5353	. . 3 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜑} ∈ 𝒫 𝐵
4		nfra1 3272	. . . . 5 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑)
5	2	unissi 4922	. . . . . . . 8 ⊢ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} ⊆ ∪ 𝐵
6	5	sseli 3975	. . . . . . 7 ⊢ (𝑥 ∈ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} → 𝑥 ∈ ∪ 𝐵)
7		cover2.2	. . . . . . 7 ⊢ 𝐴 = ∪ 𝐵
8	6, 7	eleqtrrdi 2837	. . . . . 6 ⊢ (𝑥 ∈ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} → 𝑥 ∈ 𝐴)
9		rsp 3235	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑)))
10		elunirab 4928	. . . . . . 7 ⊢ (𝑥 ∈ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} ↔ ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))
11	9, 10	imbitrrdi 251	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑}))
12	8, 11	impbid2 225	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) → (𝑥 ∈ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} ↔ 𝑥 ∈ 𝐴))
13	4, 12	alrimi 2202	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 ∈ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} ↔ 𝑥 ∈ 𝐴))
14		dfcleq 2719	. . . 4 ⊢ (∪ {𝑦 ∈ 𝐵 ∣ 𝜑} = 𝐴 ↔ ∀𝑥(𝑥 ∈ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} ↔ 𝑥 ∈ 𝐴))
15	13, 14	sylibr 233	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) → ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} = 𝐴)
16		nfrab1 3439	. . . . . . 7 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐵 ∣ 𝜑}
17	16	nfeq2 2910	. . . . . 6 ⊢ Ⅎ𝑦 𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑}
18		eleq2 2815	. . . . . . 7 ⊢ (𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑} → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑦 ∈ 𝐵 ∣ 𝜑}))
19		rabid 3440	. . . . . . . 8 ⊢ (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ 𝜑} ↔ (𝑦 ∈ 𝐵 ∧ 𝜑))
20	19	simprbi 495	. . . . . . 7 ⊢ (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ 𝜑} → 𝜑)
21	18, 20	biimtrdi 252	. . . . . 6 ⊢ (𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑} → (𝑦 ∈ 𝑧 → 𝜑))
22	17, 21	ralrimi 3245	. . . . 5 ⊢ (𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑} → ∀𝑦 ∈ 𝑧 𝜑)
23		unieq 4924	. . . . . . 7 ⊢ (𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑} → ∪ 𝑧 = ∪ {𝑦 ∈ 𝐵 ∣ 𝜑})
24	23	eqeq1d 2728	. . . . . 6 ⊢ (𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑} → (∪ 𝑧 = 𝐴 ↔ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} = 𝐴))
25	24	anbi1d 629	. . . . 5 ⊢ (𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑} → ((∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑) ↔ (∪ {𝑦 ∈ 𝐵 ∣ 𝜑} = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑)))
26	22, 25	mpbiran2d 706	. . . 4 ⊢ (𝑧 = {𝑦 ∈ 𝐵 ∣ 𝜑} → ((∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑) ↔ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} = 𝐴))
27	26	rspcev 3608	. . 3 ⊢ (({𝑦 ∈ 𝐵 ∣ 𝜑} ∈ 𝒫 𝐵 ∧ ∪ {𝑦 ∈ 𝐵 ∣ 𝜑} = 𝐴) → ∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))
28	3, 15, 27	sylancr 585	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) → ∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))
29		elpwi 4614	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝒫 𝐵 → 𝑧 ⊆ 𝐵)
30		r19.29r 3106	. . . . . . . . . . 11 ⊢ ((∃𝑦 ∈ 𝑧 𝑥 ∈ 𝑦 ∧ ∀𝑦 ∈ 𝑧 𝜑) → ∃𝑦 ∈ 𝑧 (𝑥 ∈ 𝑦 ∧ 𝜑))
31	30	expcom 412	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑧 𝜑 → (∃𝑦 ∈ 𝑧 𝑥 ∈ 𝑦 → ∃𝑦 ∈ 𝑧 (𝑥 ∈ 𝑦 ∧ 𝜑)))
32		ssrexv 4049	. . . . . . . . . 10 ⊢ (𝑧 ⊆ 𝐵 → (∃𝑦 ∈ 𝑧 (𝑥 ∈ 𝑦 ∧ 𝜑) → ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑)))
33	31, 32	sylan9r 507	. . . . . . . . 9 ⊢ ((𝑧 ⊆ 𝐵 ∧ ∀𝑦 ∈ 𝑧 𝜑) → (∃𝑦 ∈ 𝑧 𝑥 ∈ 𝑦 → ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑)))
34	29, 33	sylan 578	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦 ∈ 𝑧 𝜑) → (∃𝑦 ∈ 𝑧 𝑥 ∈ 𝑦 → ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑)))
35		eleq2 2815	. . . . . . . . . 10 ⊢ (∪ 𝑧 = 𝐴 → (𝑥 ∈ ∪ 𝑧 ↔ 𝑥 ∈ 𝐴))
36	35	biimpar 476	. . . . . . . . 9 ⊢ ((∪ 𝑧 = 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ∪ 𝑧)
37		eluni2 4917	. . . . . . . . 9 ⊢ (𝑥 ∈ ∪ 𝑧 ↔ ∃𝑦 ∈ 𝑧 𝑥 ∈ 𝑦)
38	36, 37	sylib 217	. . . . . . . 8 ⊢ ((∪ 𝑧 = 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝑧 𝑥 ∈ 𝑦)
39	34, 38	impel 504	. . . . . . 7 ⊢ (((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦 ∈ 𝑧 𝜑) ∧ (∪ 𝑧 = 𝐴 ∧ 𝑥 ∈ 𝐴)) → ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))
40	39	anassrs 466	. . . . . 6 ⊢ ((((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦 ∈ 𝑧 𝜑) ∧ ∪ 𝑧 = 𝐴) ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))
41	40	ralrimiva 3136	. . . . 5 ⊢ (((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦 ∈ 𝑧 𝜑) ∧ ∪ 𝑧 = 𝐴) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))
42	41	anasss 465	. . . 4 ⊢ ((𝑧 ∈ 𝒫 𝐵 ∧ (∀𝑦 ∈ 𝑧 𝜑 ∧ ∪ 𝑧 = 𝐴)) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))
43	42	ancom2s 648	. . 3 ⊢ ((𝑧 ∈ 𝒫 𝐵 ∧ (∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑)) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))
44	43	rexlimiva 3137	. 2 ⊢ (∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))
45	28, 44	impbii 208	1 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394  ∀wal 1532   = wceq 1534   ∈ wcel 2099  ∀wral 3051  ∃wrex 3060  {crab 3419  Vcvv 3462   ⊆ wss 3947  𝒫 cpw 4607  ∪ cuni 4913

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-sep 5304

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3464  df-in 3954  df-ss 3964  df-pw 4609  df-uni 4914

This theorem is referenced by:  cover2g  37417