Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  crefi Structured version   Visualization version   GIF version

Theorem crefi 34461
Description: The property that every open cover has an 𝐴 refinement for the topological space 𝐽. (Contributed by Thierry Arnoux, 7-Jan-2020.)
Hypothesis
Ref Expression
crefi.x 𝑋 = ∪ 𝐽
Assertion
Ref Expression
crefi ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)
Distinct variable groups:   𝑧,𝐴   𝑧,𝐽   𝑧,𝐶
Allowed substitution hint:   𝑋(𝑧)

Proof of Theorem crefi
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 simp1 1154 . . 3 ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐽 ∈ CovHasRef𝐴)
2 simp2 1155 . . 3 ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐶 ⊆ 𝐽)
31, 2sselpwd 5290 . 2 ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐶 ∈ 𝒫 𝐽)
4 crefi.x . . . . 5 𝑋 = ∪ 𝐽
54iscref 34458 . . . 4 (𝐽 ∈ CovHasRef𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦)))
65simprbi 503 . . 3 (𝐽 ∈ CovHasRef𝐴 → ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦))
763ad2ant1 1151 . 2 ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦))
8 simp3 1156 . 2 ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝑋 = ∪ 𝐶)
9 unieq 4878 . . . . 5 (𝑦 = 𝐶 → ∪ 𝑦 = ∪ 𝐶)
109eqeq2d 2772 . . . 4 (𝑦 = 𝐶 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝐶))
11 breq2 5107 . . . . 5 (𝑦 = 𝐶 → (𝑧Ref𝑦 ↔ 𝑧Ref𝐶))
1211rexbidv 3187 . . . 4 (𝑦 = 𝐶 → (∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦 ↔ ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶))
1310, 12imbi12d 347 . . 3 (𝑦 = 𝐶 → ((𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦) ↔ (𝑋 = ∪ 𝐶 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)))
1413rspcv 3573 . 2 (𝐶 ∈ 𝒫 𝐽 → (∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦) → (𝑋 = ∪ 𝐶 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)))
153, 7, 8, 14syl3c 67 1 ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867   class class class wbr 5103  Topctop 23191  Refcref 23801  CovHasRefccref 34456
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-ext 2733  ax-sep 5249
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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-cref 34457
This theorem is used by:  crefdf  34462
  Copyright terms: Public domain W3C validator