Theorem rabrsn 4668

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 4666	. . 3 ⊢ {𝑥 ∈ {𝐴} ∣ 𝜑} = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅)
2	1	eqeq2i 2749	. 2 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} ↔ 𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅))
3		ifeqor 4518	. . . 4 ⊢ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴} ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅)
4		orcom 871	. . . 4 ⊢ ((if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴} ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅) ↔ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴}))
5	3, 4	mpbi 230	. . 3 ⊢ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴})
6		eqeq1 2740	. . . 4 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = ∅ ↔ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅))
7		eqeq1 2740	. . . 4 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = {𝐴} ↔ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴}))
8	6, 7	orbi12d 919	. . 3 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → ((𝑀 = ∅ ∨ 𝑀 = {𝐴}) ↔ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴})))
9	5, 8	mpbiri 258	. 2 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))
10	2, 9	sylbi 217	1 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))

Syntax hints:   → wi 4   ∨ wo 848   = wceq 1542  {crab 3389  [wsbc 3728  ∅c0 4273  ifcif 4466  {csn 4567

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-rab 3390  df-sbc 3729  df-dif 3892  df-nul 4274  df-if 4467  df-sn 4568

This theorem is referenced by:  hashrabrsn  14334  hashrabsn01  14335  hashrabsn1  14336  dvnprodlem3  46376