Theorem bj-snmoore 37783

Description: A singleton is a Moore collection. See bj-snmooreb 37784 for a biconditional version. (Contributed by BJ, 10-Apr-2024.)

Assertion

Ref	Expression
bj-snmoore	⊢ (𝐴 ∈ 𝑉 → {𝐴} ∈ Moore)

Proof of Theorem bj-snmoore

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unisng 4889	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)
2		snidg 4625	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
3	1, 2	eqeltrd 2862	. 2 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} ∈ {𝐴})
4		df-ne 2958	. . . . . 6 ⊢ (𝑥 ≠ ∅ ↔ ¬ 𝑥 = ∅)
5		sssn 4791	. . . . . 6 ⊢ (𝑥 ⊆ {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
6		biorf 949	. . . . . . 7 ⊢ (¬ 𝑥 = ∅ → (𝑥 = {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴})))
7	6	biimpar 482	. . . . . 6 ⊢ ((¬ 𝑥 = ∅ ∧ (𝑥 = ∅ ∨ 𝑥 = {𝐴})) → 𝑥 = {𝐴})
8	4, 5, 7	syl2anb 609	. . . . 5 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ {𝐴}) → 𝑥 = {𝐴})
9		inteq 4914	. . . . . . 7 ⊢ (𝑥 = {𝐴} → ∩ 𝑥 = ∩ {𝐴})
10		intsng 4947	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴} = 𝐴)
11		eqtr 2782	. . . . . . . 8 ⊢ ((∩ 𝑥 = ∩ {𝐴} ∧ ∩ {𝐴} = 𝐴) → ∩ 𝑥 = 𝐴)
12	11	ex 417	. . . . . . 7 ⊢ (∩ 𝑥 = ∩ {𝐴} → (∩ {𝐴} = 𝐴 → ∩ 𝑥 = 𝐴))
13	9, 10, 12	syl2im 41	. . . . . 6 ⊢ (𝑥 = {𝐴} → (𝐴 ∈ 𝑉 → ∩ 𝑥 = 𝐴))
14		intex 5313	. . . . . . . 8 ⊢ (𝑥 ≠ ∅ ↔ ∩ 𝑥 ∈ V)
15		elsng 4602	. . . . . . . 8 ⊢ (∩ 𝑥 ∈ V → (∩ 𝑥 ∈ {𝐴} ↔ ∩ 𝑥 = 𝐴))
16	14, 15	sylbi 220	. . . . . . 7 ⊢ (𝑥 ≠ ∅ → (∩ 𝑥 ∈ {𝐴} ↔ ∩ 𝑥 = 𝐴))
17	16	biimprd 251	. . . . . 6 ⊢ (𝑥 ≠ ∅ → (∩ 𝑥 = 𝐴 → ∩ 𝑥 ∈ {𝐴}))
18	13, 17	sylan9r 517	. . . . 5 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 = {𝐴}) → (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}))
19	8, 18	syldan 602	. . . 4 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ {𝐴}) → (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}))
20	19	ancoms 463	. . 3 ⊢ ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}))
21	20	impcom 412	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅)) → ∩ 𝑥 ∈ {𝐴})
22	3, 21	bj-ismooredr2 37780	1 ⊢ (𝐴 ∈ 𝑉 → {𝐴} ∈ Moore)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  Vcvv 3454   ⊆ wss 3904  ∅c0 4285  {csn 4588  ∪ cuni 4871  ∩ cint 4911  Moorecmoore 37773

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-pw 4563  df-sn 4589  df-pr 4591  df-uni 4872  df-int 4912  df-bj-moore 37774

This theorem is used by:  bj-snmooreb  37784  bj-prmoore  37785