![]() |
Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cover2g | Structured version Visualization version GIF version |
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, 21-Jun-2010.) |
Ref | Expression |
---|---|
cover2g.1 | ⊢ 𝐴 = ∪ 𝐵 |
Ref | Expression |
---|---|
cover2g | ⊢ (𝐵 ∈ 𝐶 → (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unieq 4811 | . . . 4 ⊢ (𝑏 = 𝐵 → ∪ 𝑏 = ∪ 𝐵) | |
2 | cover2g.1 | . . . 4 ⊢ 𝐴 = ∪ 𝐵 | |
3 | 1, 2 | eqtr4di 2851 | . . 3 ⊢ (𝑏 = 𝐵 → ∪ 𝑏 = 𝐴) |
4 | rexeq 3359 | . . 3 ⊢ (𝑏 = 𝐵 → (∃𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))) | |
5 | 3, 4 | raleqbidv 3354 | . 2 ⊢ (𝑏 = 𝐵 → (∀𝑥 ∈ ∪ 𝑏∃𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 ∧ 𝜑) ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑))) |
6 | pweq 4513 | . . 3 ⊢ (𝑏 = 𝐵 → 𝒫 𝑏 = 𝒫 𝐵) | |
7 | 3 | eqeq2d 2809 | . . . 4 ⊢ (𝑏 = 𝐵 → (∪ 𝑧 = ∪ 𝑏 ↔ ∪ 𝑧 = 𝐴)) |
8 | 7 | anbi1d 632 | . . 3 ⊢ (𝑏 = 𝐵 → ((∪ 𝑧 = ∪ 𝑏 ∧ ∀𝑦 ∈ 𝑧 𝜑) ↔ (∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))) |
9 | 6, 8 | rexeqbidv 3355 | . 2 ⊢ (𝑏 = 𝐵 → (∃𝑧 ∈ 𝒫 𝑏(∪ 𝑧 = ∪ 𝑏 ∧ ∀𝑦 ∈ 𝑧 𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))) |
10 | vex 3444 | . . 3 ⊢ 𝑏 ∈ V | |
11 | eqid 2798 | . . 3 ⊢ ∪ 𝑏 = ∪ 𝑏 | |
12 | 10, 11 | cover2 35152 | . 2 ⊢ (∀𝑥 ∈ ∪ 𝑏∃𝑦 ∈ 𝑏 (𝑥 ∈ 𝑦 ∧ 𝜑) ↔ ∃𝑧 ∈ 𝒫 𝑏(∪ 𝑧 = ∪ 𝑏 ∧ ∀𝑦 ∈ 𝑧 𝜑)) |
13 | 5, 9, 12 | vtoclbg 3517 | 1 ⊢ (𝐵 ∈ 𝐶 → (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 ∧ 𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵(∪ 𝑧 = 𝐴 ∧ ∀𝑦 ∈ 𝑧 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 𝒫 cpw 4497 ∪ cuni 4800 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-in 3888 df-ss 3898 df-pw 4499 df-uni 4801 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |