Theorem bj-ismooredr2 35281

Description: Sufficient condition to be a Moore collection (variant of bj-ismooredr 35280 singling out the empty intersection). Note that there is no sethood hypothesis on 𝐴: it is a consequence of the first hypothesis. (Contributed by BJ, 9-Dec-2021.)

Hypotheses

Ref	Expression
bj-ismooredr2.1	⊢ (𝜑 → ∪ 𝐴 ∈ 𝐴)
bj-ismooredr2.2	⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) → ∩ 𝑥 ∈ 𝐴)

Assertion

Ref	Expression
bj-ismooredr2	⊢ (𝜑 → 𝐴 ∈ Moore)

Distinct variable groups:   𝜑,𝑥   𝑥,𝐴

Proof of Theorem bj-ismooredr2

Step	Hyp	Ref	Expression
1		bj-ismooredr2.2	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅)) → ∩ 𝑥 ∈ 𝐴)
2	1	anassrs 468	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ⊆ 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ 𝐴)
3		intssuni2 4904	. . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ ∪ 𝐴)
4		dfss 3905	. . . . . . . 8 ⊢ (∩ 𝑥 ⊆ ∪ 𝐴 ↔ ∩ 𝑥 = (∩ 𝑥 ∩ ∪ 𝐴))
5		incom 4135	. . . . . . . . . . 11 ⊢ (∩ 𝑥 ∩ ∪ 𝐴) = (∪ 𝐴 ∩ ∩ 𝑥)
6	5	eqeq2i 2751	. . . . . . . . . 10 ⊢ (∩ 𝑥 = (∩ 𝑥 ∩ ∪ 𝐴) ↔ ∩ 𝑥 = (∪ 𝐴 ∩ ∩ 𝑥))
7		eleq1 2826	. . . . . . . . . 10 ⊢ (∩ 𝑥 = (∪ 𝐴 ∩ ∩ 𝑥) → (∩ 𝑥 ∈ 𝐴 ↔ (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
8	6, 7	sylbi 216	. . . . . . . . 9 ⊢ (∩ 𝑥 = (∩ 𝑥 ∩ ∪ 𝐴) → (∩ 𝑥 ∈ 𝐴 ↔ (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
9	8	biimpd 228	. . . . . . . 8 ⊢ (∩ 𝑥 = (∩ 𝑥 ∩ ∪ 𝐴) → (∩ 𝑥 ∈ 𝐴 → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
10	4, 9	sylbi 216	. . . . . . 7 ⊢ (∩ 𝑥 ⊆ ∪ 𝐴 → (∩ 𝑥 ∈ 𝐴 → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
11	3, 10	syl 17	. . . . . 6 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → (∩ 𝑥 ∈ 𝐴 → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
12	11	adantll 711	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ⊆ 𝐴) ∧ 𝑥 ≠ ∅) → (∩ 𝑥 ∈ 𝐴 → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
13	2, 12	mpd 15	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ⊆ 𝐴) ∧ 𝑥 ≠ ∅) → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴)
14	13	ex 413	. . 3 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝐴) → (𝑥 ≠ ∅ → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
15		nne 2947	. . . . 5 ⊢ (¬ 𝑥 ≠ ∅ ↔ 𝑥 = ∅)
16		bj-ismooredr2.1	. . . . . 6 ⊢ (𝜑 → ∪ 𝐴 ∈ 𝐴)
17		rint0 4921	. . . . . 6 ⊢ (𝑥 = ∅ → (∪ 𝐴 ∩ ∩ 𝑥) = ∪ 𝐴)
18		eleq1a 2834	. . . . . 6 ⊢ (∪ 𝐴 ∈ 𝐴 → ((∪ 𝐴 ∩ ∩ 𝑥) = ∪ 𝐴 → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
19	16, 17, 18	syl2im 40	. . . . 5 ⊢ (𝜑 → (𝑥 = ∅ → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
20	15, 19	syl5bi 241	. . . 4 ⊢ (𝜑 → (¬ 𝑥 ≠ ∅ → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
21	20	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝐴) → (¬ 𝑥 ≠ ∅ → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴))
22	14, 21	pm2.61d 179	. 2 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝐴) → (∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴)
23	22	bj-ismooredr 35280	1 ⊢ (𝜑 → 𝐴 ∈ Moore)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106   ≠ wne 2943   ∩ cin 3886   ⊆ wss 3887  ∅c0 4256  ∪ cuni 4839  ∩ cint 4879  Moorecmoore 35274

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-in 3894  df-ss 3904  df-nul 4257  df-pw 4535  df-uni 4840  df-int 4880  df-bj-moore 35275

This theorem is referenced by:  bj-snmoore  35284  bj-prmoore  35286