Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cover2 Structured version   Visualization version   GIF version

Theorem cover2 35799
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
StepHypRef Expression
1 cover2.1 . . . 4 𝐵 ∈ V
2 ssrab2 4009 . . . 4 {𝑦𝐵𝜑} ⊆ 𝐵
31, 2elpwi2 5265 . . 3 {𝑦𝐵𝜑} ∈ 𝒫 𝐵
4 nfra1 3142 . . . . 5 𝑥𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑)
52unissi 4845 . . . . . . . 8 {𝑦𝐵𝜑} ⊆ 𝐵
65sseli 3913 . . . . . . 7 (𝑥 {𝑦𝐵𝜑} → 𝑥 𝐵)
7 cover2.2 . . . . . . 7 𝐴 = 𝐵
86, 7eleqtrrdi 2850 . . . . . 6 (𝑥 {𝑦𝐵𝜑} → 𝑥𝐴)
9 rsp 3129 . . . . . . 7 (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) → (𝑥𝐴 → ∃𝑦𝐵 (𝑥𝑦𝜑)))
10 elunirab 4852 . . . . . . 7 (𝑥 {𝑦𝐵𝜑} ↔ ∃𝑦𝐵 (𝑥𝑦𝜑))
119, 10syl6ibr 251 . . . . . 6 (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) → (𝑥𝐴𝑥 {𝑦𝐵𝜑}))
128, 11impbid2 225 . . . . 5 (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) → (𝑥 {𝑦𝐵𝜑} ↔ 𝑥𝐴))
134, 12alrimi 2209 . . . 4 (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) → ∀𝑥(𝑥 {𝑦𝐵𝜑} ↔ 𝑥𝐴))
14 dfcleq 2731 . . . 4 ( {𝑦𝐵𝜑} = 𝐴 ↔ ∀𝑥(𝑥 {𝑦𝐵𝜑} ↔ 𝑥𝐴))
1513, 14sylibr 233 . . 3 (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) → {𝑦𝐵𝜑} = 𝐴)
16 nfrab1 3310 . . . . . . 7 𝑦{𝑦𝐵𝜑}
1716nfeq2 2923 . . . . . 6 𝑦 𝑧 = {𝑦𝐵𝜑}
18 eleq2 2827 . . . . . . 7 (𝑧 = {𝑦𝐵𝜑} → (𝑦𝑧𝑦 ∈ {𝑦𝐵𝜑}))
19 rabid 3304 . . . . . . . 8 (𝑦 ∈ {𝑦𝐵𝜑} ↔ (𝑦𝐵𝜑))
2019simprbi 496 . . . . . . 7 (𝑦 ∈ {𝑦𝐵𝜑} → 𝜑)
2118, 20syl6bi 252 . . . . . 6 (𝑧 = {𝑦𝐵𝜑} → (𝑦𝑧𝜑))
2217, 21ralrimi 3139 . . . . 5 (𝑧 = {𝑦𝐵𝜑} → ∀𝑦𝑧 𝜑)
23 unieq 4847 . . . . . . 7 (𝑧 = {𝑦𝐵𝜑} → 𝑧 = {𝑦𝐵𝜑})
2423eqeq1d 2740 . . . . . 6 (𝑧 = {𝑦𝐵𝜑} → ( 𝑧 = 𝐴 {𝑦𝐵𝜑} = 𝐴))
2524anbi1d 629 . . . . 5 (𝑧 = {𝑦𝐵𝜑} → (( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑) ↔ ( {𝑦𝐵𝜑} = 𝐴 ∧ ∀𝑦𝑧 𝜑)))
2622, 25mpbiran2d 704 . . . 4 (𝑧 = {𝑦𝐵𝜑} → (( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑) ↔ {𝑦𝐵𝜑} = 𝐴))
2726rspcev 3552 . . 3 (({𝑦𝐵𝜑} ∈ 𝒫 𝐵 {𝑦𝐵𝜑} = 𝐴) → ∃𝑧 ∈ 𝒫 𝐵( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑))
283, 15, 27sylancr 586 . 2 (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) → ∃𝑧 ∈ 𝒫 𝐵( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑))
29 elpwi 4539 . . . . . . . . 9 (𝑧 ∈ 𝒫 𝐵𝑧𝐵)
30 r19.29r 3184 . . . . . . . . . . 11 ((∃𝑦𝑧 𝑥𝑦 ∧ ∀𝑦𝑧 𝜑) → ∃𝑦𝑧 (𝑥𝑦𝜑))
3130expcom 413 . . . . . . . . . 10 (∀𝑦𝑧 𝜑 → (∃𝑦𝑧 𝑥𝑦 → ∃𝑦𝑧 (𝑥𝑦𝜑)))
32 ssrexv 3984 . . . . . . . . . 10 (𝑧𝐵 → (∃𝑦𝑧 (𝑥𝑦𝜑) → ∃𝑦𝐵 (𝑥𝑦𝜑)))
3331, 32sylan9r 508 . . . . . . . . 9 ((𝑧𝐵 ∧ ∀𝑦𝑧 𝜑) → (∃𝑦𝑧 𝑥𝑦 → ∃𝑦𝐵 (𝑥𝑦𝜑)))
3429, 33sylan 579 . . . . . . . 8 ((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦𝑧 𝜑) → (∃𝑦𝑧 𝑥𝑦 → ∃𝑦𝐵 (𝑥𝑦𝜑)))
35 eleq2 2827 . . . . . . . . . 10 ( 𝑧 = 𝐴 → (𝑥 𝑧𝑥𝐴))
3635biimpar 477 . . . . . . . . 9 (( 𝑧 = 𝐴𝑥𝐴) → 𝑥 𝑧)
37 eluni2 4840 . . . . . . . . 9 (𝑥 𝑧 ↔ ∃𝑦𝑧 𝑥𝑦)
3836, 37sylib 217 . . . . . . . 8 (( 𝑧 = 𝐴𝑥𝐴) → ∃𝑦𝑧 𝑥𝑦)
3934, 38impel 505 . . . . . . 7 (((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦𝑧 𝜑) ∧ ( 𝑧 = 𝐴𝑥𝐴)) → ∃𝑦𝐵 (𝑥𝑦𝜑))
4039anassrs 467 . . . . . 6 ((((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦𝑧 𝜑) ∧ 𝑧 = 𝐴) ∧ 𝑥𝐴) → ∃𝑦𝐵 (𝑥𝑦𝜑))
4140ralrimiva 3107 . . . . 5 (((𝑧 ∈ 𝒫 𝐵 ∧ ∀𝑦𝑧 𝜑) ∧ 𝑧 = 𝐴) → ∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑))
4241anasss 466 . . . 4 ((𝑧 ∈ 𝒫 𝐵 ∧ (∀𝑦𝑧 𝜑 𝑧 = 𝐴)) → ∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑))
4342ancom2s 646 . . 3 ((𝑧 ∈ 𝒫 𝐵 ∧ ( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑)) → ∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑))
4443rexlimiva 3209 . 2 (∃𝑧 ∈ 𝒫 𝐵( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑) → ∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑))
4528, 44impbii 208 1 (∀𝑥𝐴𝑦𝐵 (𝑥𝑦𝜑) ↔ ∃𝑧 ∈ 𝒫 𝐵( 𝑧 = 𝐴 ∧ ∀𝑦𝑧 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wal 1537   = wceq 1539  wcel 2108  wral 3063  wrex 3064  {crab 3067  Vcvv 3422  wss 3883  𝒫 cpw 4530   cuni 4836
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-in 3890  df-ss 3900  df-pw 4532  df-uni 4837
This theorem is referenced by:  cover2g  35800
  Copyright terms: Public domain W3C validator