Theorem rabrsn 4685

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 4683	. . 3 ⊢ {𝑥 ∈ {𝐴} ∣ 𝜑} = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅)
2	1	eqeq2i 2773	. 2 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} ↔ 𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅))
3		ifeqor 4534	. . . 4 ⊢ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴} ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅)
4		orcom 884	. . . 4 ⊢ ((if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴} ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅) ↔ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴}))
5	3, 4	mpbi 233	. . 3 ⊢ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴})
6		eqeq1 2764	. . . 4 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = ∅ ↔ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅))
7		eqeq1 2764	. . . 4 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = {𝐴} ↔ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴}))
8	6, 7	orbi12d 932	. . 3 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → ((𝑀 = ∅ ∨ 𝑀 = {𝐴}) ↔ (if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = ∅ ∨ if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) = {𝐴})))
9	5, 8	mpbiri 261	. 2 ⊢ (𝑀 = if([𝐴 / 𝑥]𝜑, {𝐴}, ∅) → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))
10	2, 9	sylbi 220	1 ⊢ (𝑀 = {𝑥 ∈ {𝐴} ∣ 𝜑} → (𝑀 = ∅ ∨ 𝑀 = {𝐴}))

This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1570  {crab 3412  [wsbc 3739  ∅c0 4279  ifcif 4482  {csn 4584

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-rab 3413  df-sbc 3740  df-dif 3902  df-nul 4280  df-if 4483  df-sn 4585

This theorem is used by:  hashrabrsn  14437  hashrabsn01  14438  hashrabsn1  14439  dvnprodlem3  46777