Theorem rabrsn 4690

Description: A restricted class abstraction restricted to a singleton is either the empty set or the singleton itself. (Contributed by Alexander van der Vekens, 22-Dec-2017.) (Proof shortened by AV, 21-Jul-2019.)

Assertion

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

Distinct variable group:   𝑥,𝐴

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

Proof of Theorem rabrsn

Step	Hyp	Ref	Expression
1		rabsnifsb 4688	. . 3 ⊢ {𝑥 ∈ {𝐴} ∣ 𝜑} = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅)
2	1	eqeq2i 2776	. 2 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} ↔ 𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅))
3		ifeqor 4539	. . . 4 ⊢ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴} ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅)
4		orcom 883	. . . 4 ⊢ ((if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴} ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅) ↔ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴}))
5	3, 4	mpbi 233	. . 3 ⊢ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴})
6		eqeq1 2767	. . . 4 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = ∅ ↔ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅))
7		eqeq1 2767	. . . 4 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = {𝐴} ↔ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴}))
8	6, 7	orbi12d 931	. . 3 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → ((𝑀 = ∅ ∨ 𝑀 = {𝐴}) ↔ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴})))
9	5, 8	mpbiri 261	. 2 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))
10	2, 9	sylbi 220	1 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))

Syntax hints:   → wi 4   ∨ wo 860   = wceq 1570  {crab 3416  [wsbc 3744  ∅c0 4286  ifcif 4487  {csn 4589

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3417  df-sbc 3745  df-dif 3908  df-nul 4287  df-if 4488  df-sn 4590

This theorem is referenced by:  hashrabrsn  14404  hashrabsn01  14405  hashrabsn1  14406  dvnprodlem3  46682