Theorem rabbi 3383

Description: Equivalent wff's correspond to equal restricted class abstractions. Closed theorem form of rabbidva 3478. (Contributed by NM, 25-Nov-2013.)

Assertion

Ref	Expression
rabbi	⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒})

Proof of Theorem rabbi

Step	Hyp	Ref	Expression
1		abbi 2888	. 2 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)) ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜒)})
2		df-ral 3143	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜓 ↔ 𝜒)))
3		pm5.32 576	. . . 4 ⊢ ((𝑥 ∈ 𝐴 → (𝜓 ↔ 𝜒)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)))
4	3	albii 1816	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → (𝜓 ↔ 𝜒)) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)))
5	2, 4	bitri 277	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)))
6		df-rab 3147	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)}
7		df-rab 3147	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜒} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜒)}
8	6, 7	eqeq12i 2836	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒} ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜒)})
9	1, 5, 8	3bitr4i 305	1 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1531   = wceq 1533   ∈ wcel 2110  {cab 2799  ∀wral 3138  {crab 3142

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-ral 3143  df-rab 3147

This theorem is referenced by:  rabbida  3474  rabbidvaOLD  3479  kqfeq  22326  isr0  22339  rabeq12f  35429  eq0rabdioph  39366  eqrabdioph  39367  lerabdioph  39395  eluzrabdioph  39396  ltrabdioph  39398  nerabdioph  39399  dvdsrabdioph  39400  undisjrab  40631  ioodvbdlimc1lem2  42210  ioodvbdlimc2lem  42212  fourierdlem89  42474  fourierdlem91  42476  fourierdlem100  42485  fourierdlem108  42493  fourierdlem112  42497  ovn0  42842  issmfdmpt  43019  line2x  44735  line2y  44736