Theorem crefi 34268

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.

Step	Hyp	Ref	Expression
1		simp1 1154	. . 3 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐽 ∈ CovHasRef𝐴)
2		simp2 1155	. . 3 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐶 ⊆ 𝐽)
3	1, 2	sselpwd 5304	. 2 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐶 ∈ 𝒫 𝐽)
4		crefi.x	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
5	4	iscref 34265	. . . 4 ⊢ (𝐽 ∈ CovHasRef𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦)))
6	5	simprbi 503	. . 3 ⊢ (𝐽 ∈ CovHasRef𝐴 → ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦))
7	6	3ad2ant1 1151	. 2 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦))
8		simp3 1156	. 2 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝑋 = ∪ 𝐶)
9		unieq 4888	. . . . 5 ⊢ (𝑦 = 𝐶 → ∪ 𝑦 = ∪ 𝐶)
10	9	eqeq2d 2777	. . . 4 ⊢ (𝑦 = 𝐶 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝐶))
11		breq2 5118	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝑧Ref𝑦 ↔ 𝑧Ref𝐶))
12	11	rexbidv 3192	. . . 4 ⊢ (𝑦 = 𝐶 → (∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦 ↔ ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶))
13	10, 12	imbi12d 347	. . 3 ⊢ (𝑦 = 𝐶 → ((𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦) ↔ (𝑋 = ∪ 𝐶 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)))
14	13	rspcv 3580	. 2 ⊢ (𝐶 ∈ 𝒫 𝐽 → (∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦) → (𝑋 = ∪ 𝐶 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)))
15	3, 7, 8, 14	syl3c 67	1 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3082  ∃wrex 3092   ∩ cin 3907   ⊆ wss 3908  𝒫 cpw 4567  ∪ cuni 4877   class class class wbr 5114  Topctop 23087  Refcref 23696  CovHasRefccref 34263

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262

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 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-cref 34264

This theorem is used by:  crefdf  34269