Theorem oprabbidv 7479

Description: Equivalent wff's yield equal operation class abstractions (deduction form). (Contributed by NM, 21-Feb-2004.)

Hypothesis

Ref	Expression
oprabbidv.1	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
oprabbidv	⊢ (𝜑 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜒})

Distinct variable groups:   𝑥,𝑧,𝜑   𝑦,𝑧,𝜑

Allowed substitution hints:   𝜓(𝑥, 𝑦, 𝑧)   𝜒(𝑥, 𝑦, 𝑧)

Proof of Theorem oprabbidv

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oprabbidv.1	. . . . . . 7 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
2	1	anbi2d 642	. . . . . 6 ⊢ (𝜑 → ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜓) ↔ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜒)))
3	2	exbidv 1954	. . . . 5 ⊢ (𝜑 → (∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜓) ↔ ∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜒)))
4	3	exbidv 1954	. . . 4 ⊢ (𝜑 → (∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜓) ↔ ∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜒)))
5	4	exbidv 1954	. . 3 ⊢ (𝜑 → (∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜓) ↔ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜒)))
6	5	abbidv 2826	. 2 ⊢ (𝜑 → {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜓)} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜒)})
7		df-oprab 7417	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜓)}
8		df-oprab 7417	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜒} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜒)}
9	6, 7, 8	3eqtr4g 2820	1 ⊢ (𝜑 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜒})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812  {cab 2738  ⟨cop 4590  {coprab 7414

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-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-oprab 7417

This theorem is used by:  oprabbii  7480  mpoeq123dva  7487  mpoeq3dva  7490  resoprab2  7532  erovlem  8813  uncf  8870  joinfval  18459  meetfval  18473  odujoin  18494  odumeet  18496  mppsval  36151  csbmpo123  38085  unceq  38355  unccur  38357