Theorem bj-ismoored2 34403

Description: Necessary condition to be a Moore collection. (Contributed by BJ, 9-Dec-2021.)

Hypotheses

Ref	Expression
bj-ismoored.1	⊢ (𝜑 → 𝐴 ∈ Moore)
bj-ismoored.2	⊢ (𝜑 → 𝐵 ⊆ 𝐴)
bj-ismoored2.3	⊢ (𝜑 → 𝐵 ≠ ∅)

Assertion

Ref	Expression
bj-ismoored2	⊢ (𝜑 → ∩ 𝐵 ∈ 𝐴)

Proof of Theorem bj-ismoored2

Step	Hyp	Ref	Expression
1		bj-ismoored.2	. . . 4 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
2		bj-ismoored2.3	. . . 4 ⊢ (𝜑 → 𝐵 ≠ ∅)
3		intssuni2 4901	. . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∩ 𝐵 ⊆ ∪ 𝐴)
4	1, 2, 3	syl2anc 586	. . 3 ⊢ (𝜑 → ∩ 𝐵 ⊆ ∪ 𝐴)
5		sseqin2 4192	. . 3 ⊢ (∩ 𝐵 ⊆ ∪ 𝐴 ↔ (∪ 𝐴 ∩ ∩ 𝐵) = ∩ 𝐵)
6	4, 5	sylib 220	. 2 ⊢ (𝜑 → (∪ 𝐴 ∩ ∩ 𝐵) = ∩ 𝐵)
7		bj-ismoored.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ Moore)
8	7, 1	bj-ismoored 34402	. 2 ⊢ (𝜑 → (∪ 𝐴 ∩ ∩ 𝐵) ∈ 𝐴)
9	6, 8	eqeltrrd 2914	1 ⊢ (𝜑 → ∩ 𝐵 ∈ 𝐴)

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2114   ≠ wne 3016   ∩ cin 3935   ⊆ wss 3936  ∅c0 4291  ∪ cuni 4838  ∩ cint 4876  Moorecmoore 34398

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-in 3943  df-ss 3952  df-nul 4292  df-pw 4541  df-uni 4839  df-int 4877  df-bj-moore 34399

This theorem is referenced by: (None)