MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rabeq0w Structured version   Visualization version   GIF version

Theorem rabeq0w 4340
Description: Condition for a restricted class abstraction to be empty. Version of rabeq0 4341 using implicit substitution, which does not require ax-10 2180, ax-11 2197, ax-12 2216, but requires ax-8 2149. (Contributed by GG, 30-Sep-2024.)
Hypothesis
Ref Expression
rabeq0w.1 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
rabeq0w ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑦 ∈ 𝐴 ¬ 𝜓)
Distinct variable groups:   𝑥,𝑦,𝐴   𝜓,𝑥   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem rabeq0w
StepHypRef Expression
1 eleq1w 2847 . . . 4 (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2 rabeq0w.1 . . . 4 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
31, 2anbi12d 644 . . 3 (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
43ab0w 4331 . 2 ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = ∅ ↔ ∀𝑦 ¬ (𝑦 ∈ 𝐴 ∧ 𝜓))
5 df-rab 3417 . . 3 {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
65eqeq1i 2768 . 2 ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = ∅)
7 raln 3089 . 2 (∀𝑦 ∈ 𝐴 ¬ 𝜓 ↔ ∀𝑦 ¬ (𝑦 ∈ 𝐴 ∧ 𝜓))
84, 6, 73bitr4i 306 1 ({𝑥 ∈ 𝐴 ∣ 𝜑} = ∅ ↔ ∀𝑦 ∈ 𝐴 ¬ 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  {crab 3416  ∅c0 4281
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-dif 4050  df-nul 4282
This theorem is used by:  dffr2  5616  frc  5618  frirr  5631
  Copyright terms: Public domain W3C validator