Theorem crefi 33808

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 1135	. . 3 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐽 ∈ CovHasRef𝐴)
2		simp2 1136	. . 3 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐶 ⊆ 𝐽)
3	1, 2	sselpwd 5334	. 2 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝐶 ∈ 𝒫 𝐽)
4		crefi.x	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
5	4	iscref 33805	. . . 4 ⊢ (𝐽 ∈ CovHasRef𝐴 ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦)))
6	5	simprbi 496	. . 3 ⊢ (𝐽 ∈ CovHasRef𝐴 → ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦))
7	6	3ad2ant1 1132	. 2 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → ∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦))
8		simp3 1137	. 2 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → 𝑋 = ∪ 𝐶)
9		unieq 4923	. . . . 5 ⊢ (𝑦 = 𝐶 → ∪ 𝑦 = ∪ 𝐶)
10	9	eqeq2d 2746	. . . 4 ⊢ (𝑦 = 𝐶 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝐶))
11		breq2 5152	. . . . 5 ⊢ (𝑦 = 𝐶 → (𝑧Ref𝑦 ↔ 𝑧Ref𝐶))
12	11	rexbidv 3177	. . . 4 ⊢ (𝑦 = 𝐶 → (∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦 ↔ ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶))
13	10, 12	imbi12d 344	. . 3 ⊢ (𝑦 = 𝐶 → ((𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦) ↔ (𝑋 = ∪ 𝐶 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)))
14	13	rspcv 3618	. 2 ⊢ (𝐶 ∈ 𝒫 𝐽 → (∀𝑦 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝑦) → (𝑋 = ∪ 𝐶 → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)))
15	3, 7, 8, 14	syl3c 66	1 ⊢ ((𝐽 ∈ CovHasRef𝐴 ∧ 𝐶 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝐶) → ∃𝑧 ∈ (𝒫 𝐽 ∩ 𝐴)𝑧Ref𝐶)

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ∃wrex 3068   ∩ cin 3962   ⊆ wss 3963  𝒫 cpw 4605  ∪ cuni 4912   class class class wbr 5148  Topctop 22915  Refcref 23526  CovHasRefccref 33803

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-cref 33804

This theorem is referenced by:  crefdf  33809