Theorem rabrsndc 3690

Description: A class abstraction over a decidable proposition restricted to a singleton is either the empty set or the singleton itself. (Contributed by Jim Kingdon, 8-Aug-2018.)

Hypotheses

Ref	Expression
rabrsndc.1	⊢ 𝐴 ∈ V
rabrsndc.2	⊢ DECID 𝜑

Assertion

Ref	Expression
rabrsndc	⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝑀(𝑥)

Proof of Theorem rabrsndc

Step	Hyp	Ref	Expression
1		rabrsndc.1	. . . . . 6 ⊢ 𝐴 ∈ V
2		rabrsndc.2	. . . . . . . 8 ⊢ DECID 𝜑
3		pm2.1dc 838	. . . . . . . 8 ⊢ (DECID 𝜑 → (¬ 𝜑 ∨ 𝜑))
4	2, 3	ax-mp 5	. . . . . . 7 ⊢ (¬ 𝜑 ∨ 𝜑)
5	4	sbcth 3003	. . . . . 6 ⊢ (𝐴 ∈ V → [𝐴 / 𝑥](¬ 𝜑 ∨ 𝜑))
6	1, 5	ax-mp 5	. . . . 5 ⊢ [𝐴 / 𝑥](¬ 𝜑 ∨ 𝜑)
7		sbcor 3034	. . . . 5 ⊢ ([𝐴 / 𝑥](¬ 𝜑 ∨ 𝜑) ↔ ([𝐴 / 𝑥] ¬ 𝜑 ∨ [𝐴 / 𝑥]𝜑))
8	6, 7	mpbi 145	. . . 4 ⊢ ([𝐴 / 𝑥] ¬ 𝜑 ∨ [𝐴 / 𝑥]𝜑)
9		ralsns 3660	. . . . . 6 ⊢ (𝐴 ∈ V → (∀𝑥 ∈ {𝐴} ¬ 𝜑 ↔ [𝐴 / 𝑥] ¬ 𝜑))
10	1, 9	ax-mp 5	. . . . 5 ⊢ (∀𝑥 ∈ {𝐴} ¬ 𝜑 ↔ [𝐴 / 𝑥] ¬ 𝜑)
11		ralsns 3660	. . . . . 6 ⊢ (𝐴 ∈ V → (∀𝑥 ∈ {𝐴}𝜑 ↔ [𝐴 / 𝑥]𝜑))
12	1, 11	ax-mp 5	. . . . 5 ⊢ (∀𝑥 ∈ {𝐴}𝜑 ↔ [𝐴 / 𝑥]𝜑)
13	10, 12	orbi12i 765	. . . 4 ⊢ ((∀𝑥 ∈ {𝐴} ¬ 𝜑 ∨ ∀𝑥 ∈ {𝐴}𝜑) ↔ ([𝐴 / 𝑥] ¬ 𝜑 ∨ [𝐴 / 𝑥]𝜑))
14	8, 13	mpbir 146	. . 3 ⊢ (∀𝑥 ∈ {𝐴} ¬ 𝜑 ∨ ∀𝑥 ∈ {𝐴}𝜑)
15		rabeq0 3480	. . . 4 ⊢ ({𝑥 ∈ {𝐴} ∣ 𝜑} = ∅ ↔ ∀𝑥 ∈ {𝐴} ¬ 𝜑)
16		eqcom 2198	. . . . 5 ⊢ ({𝑥 ∈ {𝐴} ∣ 𝜑} = {𝐴} ↔ {𝐴} = {𝑥 ∈ {𝐴} ∣ 𝜑})
17		rabid2 2674	. . . . 5 ⊢ ({𝐴} = {𝑥 ∈ {𝐴} ∣ 𝜑} ↔ ∀𝑥 ∈ {𝐴}𝜑)
18	16, 17	bitri 184	. . . 4 ⊢ ({𝑥 ∈ {𝐴} ∣ 𝜑} = {𝐴} ↔ ∀𝑥 ∈ {𝐴}𝜑)
19	15, 18	orbi12i 765	. . 3 ⊢ (({𝑥 ∈ {𝐴} ∣ 𝜑} = ∅ ∨ {𝑥 ∈ {𝐴} ∣ 𝜑} = {𝐴}) ↔ (∀𝑥 ∈ {𝐴} ¬ 𝜑 ∨ ∀𝑥 ∈ {𝐴}𝜑))
20	14, 19	mpbir 146	. 2 ⊢ ({𝑥 ∈ {𝐴} ∣ 𝜑} = ∅ ∨ {𝑥 ∈ {𝐴} ∣ 𝜑} = {𝐴})
21		eqeq1 2203	. . 3 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → (𝑀 = ∅ ↔ {𝑥 ∈ {𝐴} ∣ 𝜑} = ∅))
22		eqeq1 2203	. . 3 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → (𝑀 = {𝐴} ↔ {𝑥 ∈ {𝐴} ∣ 𝜑} = {𝐴}))
23	21, 22	orbi12d 794	. 2 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → ((𝑀 = ∅ ∨ 𝑀 = {𝐴}) ↔ ({𝑥 ∈ {𝐴} ∣ 𝜑} = ∅ ∨ {𝑥 ∈ {𝐴} ∣ 𝜑} = {𝐴})))
24	20, 23	mpbiri 168	1 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 105   ∨ wo 709  DECID wdc 835   = wceq 1364   ∈ wcel 2167  ∀wral 2475  {crab 2479  Vcvv 2763  [wsbc 2989  ∅c0 3450  {csn 3622

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-dc 836  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-nul 3451  df-sn 3628

This theorem is referenced by: (None)