MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cmpcov2 Structured version   Visualization version   GIF version

Theorem cmpcov2 23398
Description: Rewrite cmpcov 23397 for the cover {𝑦𝐽𝜑}. (Contributed by Mario Carneiro, 11-Sep-2015.)
Hypothesis
Ref Expression
iscmp.1 𝑋 = 𝐽
Assertion
Ref Expression
cmpcov2 ((𝐽 ∈ Comp ∧ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦𝜑)) → ∃𝑠 ∈ (𝒫 𝐽 ∩ Fin)(𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑))
Distinct variable groups:   𝑥,𝑠,𝑦,𝐽   𝜑,𝑠,𝑥   𝑥,𝑋
Allowed substitution hints:   𝜑(𝑦)   𝑋(𝑦,𝑠)

Proof of Theorem cmpcov2
StepHypRef Expression
1 dfss3 3972 . . . . 5 (𝑋 {𝑦𝐽𝜑} ↔ ∀𝑥𝑋 𝑥 {𝑦𝐽𝜑})
2 elunirab 4922 . . . . . 6 (𝑥 {𝑦𝐽𝜑} ↔ ∃𝑦𝐽 (𝑥𝑦𝜑))
32ralbii 3093 . . . . 5 (∀𝑥𝑋 𝑥 {𝑦𝐽𝜑} ↔ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦𝜑))
41, 3sylbbr 236 . . . 4 (∀𝑥𝑋𝑦𝐽 (𝑥𝑦𝜑) → 𝑋 {𝑦𝐽𝜑})
5 ssrab2 4080 . . . . . . 7 {𝑦𝐽𝜑} ⊆ 𝐽
65unissi 4916 . . . . . 6 {𝑦𝐽𝜑} ⊆ 𝐽
7 iscmp.1 . . . . . 6 𝑋 = 𝐽
86, 7sseqtrri 4033 . . . . 5 {𝑦𝐽𝜑} ⊆ 𝑋
98a1i 11 . . . 4 (∀𝑥𝑋𝑦𝐽 (𝑥𝑦𝜑) → {𝑦𝐽𝜑} ⊆ 𝑋)
104, 9eqssd 4001 . . 3 (∀𝑥𝑋𝑦𝐽 (𝑥𝑦𝜑) → 𝑋 = {𝑦𝐽𝜑})
117cmpcov 23397 . . . 4 ((𝐽 ∈ Comp ∧ {𝑦𝐽𝜑} ⊆ 𝐽𝑋 = {𝑦𝐽𝜑}) → ∃𝑠 ∈ (𝒫 {𝑦𝐽𝜑} ∩ Fin)𝑋 = 𝑠)
125, 11mp3an2 1451 . . 3 ((𝐽 ∈ Comp ∧ 𝑋 = {𝑦𝐽𝜑}) → ∃𝑠 ∈ (𝒫 {𝑦𝐽𝜑} ∩ Fin)𝑋 = 𝑠)
1310, 12sylan2 593 . 2 ((𝐽 ∈ Comp ∧ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦𝜑)) → ∃𝑠 ∈ (𝒫 {𝑦𝐽𝜑} ∩ Fin)𝑋 = 𝑠)
14 ssrab 4073 . . . . . . . 8 (𝑠 ⊆ {𝑦𝐽𝜑} ↔ (𝑠𝐽 ∧ ∀𝑦𝑠 𝜑))
1514anbi1i 624 . . . . . . 7 ((𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑋 = 𝑠) ↔ ((𝑠𝐽 ∧ ∀𝑦𝑠 𝜑) ∧ 𝑋 = 𝑠))
16 an32 646 . . . . . . 7 (((𝑠𝐽 ∧ ∀𝑦𝑠 𝜑) ∧ 𝑋 = 𝑠) ↔ ((𝑠𝐽𝑋 = 𝑠) ∧ ∀𝑦𝑠 𝜑))
17 anass 468 . . . . . . 7 (((𝑠𝐽𝑋 = 𝑠) ∧ ∀𝑦𝑠 𝜑) ↔ (𝑠𝐽 ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)))
1815, 16, 173bitri 297 . . . . . 6 ((𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑋 = 𝑠) ↔ (𝑠𝐽 ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)))
1918anbi1i 624 . . . . 5 (((𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑋 = 𝑠) ∧ 𝑠 ∈ Fin) ↔ ((𝑠𝐽 ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)) ∧ 𝑠 ∈ Fin))
20 an32 646 . . . . 5 (((𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑠 ∈ Fin) ∧ 𝑋 = 𝑠) ↔ ((𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑋 = 𝑠) ∧ 𝑠 ∈ Fin))
21 an32 646 . . . . 5 (((𝑠𝐽𝑠 ∈ Fin) ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)) ↔ ((𝑠𝐽 ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)) ∧ 𝑠 ∈ Fin))
2219, 20, 213bitr4i 303 . . . 4 (((𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑠 ∈ Fin) ∧ 𝑋 = 𝑠) ↔ ((𝑠𝐽𝑠 ∈ Fin) ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)))
23 elfpw 9394 . . . . 5 (𝑠 ∈ (𝒫 {𝑦𝐽𝜑} ∩ Fin) ↔ (𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑠 ∈ Fin))
2423anbi1i 624 . . . 4 ((𝑠 ∈ (𝒫 {𝑦𝐽𝜑} ∩ Fin) ∧ 𝑋 = 𝑠) ↔ ((𝑠 ⊆ {𝑦𝐽𝜑} ∧ 𝑠 ∈ Fin) ∧ 𝑋 = 𝑠))
25 elfpw 9394 . . . . 5 (𝑠 ∈ (𝒫 𝐽 ∩ Fin) ↔ (𝑠𝐽𝑠 ∈ Fin))
2625anbi1i 624 . . . 4 ((𝑠 ∈ (𝒫 𝐽 ∩ Fin) ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)) ↔ ((𝑠𝐽𝑠 ∈ Fin) ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)))
2722, 24, 263bitr4i 303 . . 3 ((𝑠 ∈ (𝒫 {𝑦𝐽𝜑} ∩ Fin) ∧ 𝑋 = 𝑠) ↔ (𝑠 ∈ (𝒫 𝐽 ∩ Fin) ∧ (𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑)))
2827rexbii2 3090 . 2 (∃𝑠 ∈ (𝒫 {𝑦𝐽𝜑} ∩ Fin)𝑋 = 𝑠 ↔ ∃𝑠 ∈ (𝒫 𝐽 ∩ Fin)(𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑))
2913, 28sylib 218 1 ((𝐽 ∈ Comp ∧ ∀𝑥𝑋𝑦𝐽 (𝑥𝑦𝜑)) → ∃𝑠 ∈ (𝒫 𝐽 ∩ Fin)(𝑋 = 𝑠 ∧ ∀𝑦𝑠 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wral 3061  wrex 3070  {crab 3436  cin 3950  wss 3951  𝒫 cpw 4600   cuni 4907  Fincfn 8985  Compccmp 23394
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-in 3958  df-ss 3968  df-pw 4602  df-uni 4908  df-cmp 23395
This theorem is referenced by:  cmpcovf  23399  bwth  23418  locfincmp  23534
  Copyright terms: Public domain W3C validator