Theorem rabbi 3382

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

Assertion

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

Proof of Theorem rabbi

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

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1529   = wceq 1531   ∈ wcel 2108  {cab 2797  ∀wral 3136  {crab 3140

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-clab 2798  df-cleq 2812  df-ral 3141  df-rab 3145

This theorem is referenced by:  rabbida  3473  rabbidvaOLD  3478  kqfeq  22324  isr0  22337  rabeq12f  35427  eq0rabdioph  39363  eqrabdioph  39364  lerabdioph  39392  eluzrabdioph  39393  ltrabdioph  39395  nerabdioph  39396  dvdsrabdioph  39397  undisjrab  40628  ioodvbdlimc1lem2  42206  ioodvbdlimc2lem  42208  fourierdlem89  42470  fourierdlem91  42472  fourierdlem100  42481  fourierdlem108  42489  fourierdlem112  42493  ovn0  42838  issmfdmpt  43015  line2x  44731  line2y  44732