Theorem bj-snmoore 37863

Description: A singleton is a Moore collection. See bj-snmooreb 37864 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 4885	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)
2		snidg 4621	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
3	1, 2	eqeltrd 2860	. 2 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} ∈ {𝐴})
4		df-ne 2956	. . . . . 6 ⊢ (𝑥 ≠ ∅ ↔ ¬ 𝑥 = ∅)
5		sssn 4787	. . . . . 6 ⊢ (𝑥 ⊆ {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
6		biorf 950	. . . . . . 7 ⊢ (¬ 𝑥 = ∅ → (𝑥 = {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴})))
7	6	biimpar 483	. . . . . 6 ⊢ ((¬ 𝑥 = ∅ ∧ (𝑥 = ∅ ∨ 𝑥 = {𝐴})) → 𝑥 = {𝐴})
8	4, 5, 7	syl2anb 610	. . . . 5 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ {𝐴}) → 𝑥 = {𝐴})
9		inteq 4910	. . . . . . 7 ⊢ (𝑥 = {𝐴} → ∩ 𝑥 = ∩ {𝐴})
10		intsng 4943	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴} = 𝐴)
11		eqtr 2780	. . . . . . . 8 ⊢ ((∩ 𝑥 = ∩ {𝐴} ∧ ∩ {𝐴} = 𝐴) → ∩ 𝑥 = 𝐴)
12	11	ex 418	. . . . . . 7 ⊢ (∩ 𝑥 = ∩ {𝐴} → (∩ {𝐴} = 𝐴 → ∩ 𝑥 = 𝐴))
13	9, 10, 12	syl2im 41	. . . . . 6 ⊢ (𝑥 = {𝐴} → (𝐴 ∈ 𝑉 → ∩ 𝑥 = 𝐴))
14		intex 5308	. . . . . . . 8 ⊢ (𝑥 ≠ ∅ ↔ ∩ 𝑥 ∈ V)
15		elsng 4598	. . . . . . . 8 ⊢ (∩ 𝑥 ∈ V → (∩ 𝑥 ∈ {𝐴} ↔ ∩ 𝑥 = 𝐴))
16	14, 15	sylbi 220	. . . . . . 7 ⊢ (𝑥 ≠ ∅ → (∩ 𝑥 ∈ {𝐴} ↔ ∩ 𝑥 = 𝐴))
17	16	biimprd 251	. . . . . 6 ⊢ (𝑥 ≠ ∅ → (∩ 𝑥 = 𝐴 → ∩ 𝑥 ∈ {𝐴}))
18	13, 17	sylan9r 518	. . . . 5 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 = {𝐴}) → (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}))
19	8, 18	syldan 603	. . . 4 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ {𝐴}) → (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}))
20	19	ancoms 464	. . 3 ⊢ ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}))
21	20	impcom 413	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅)) → ∩ 𝑥 ∈ {𝐴})
22	3, 21	bj-ismooredr2 37860	1 ⊢ (𝐴 ∈ 𝑉 → {𝐴} ∈ Moore)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  Vcvv 3450   ⊆ wss 3899  ∅c0 4279  {csn 4584  ∪ cuni 4867  ∩ cint 4907  Moorecmoore 37853

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-pw 4559  df-sn 4585  df-pr 4587  df-uni 4868  df-int 4908  df-bj-moore 37854

This theorem is used by:  bj-snmooreb  37864  bj-prmoore  37865