Theorem oprabbidv 6142

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

Step	Hyp	Ref	Expression
1		nfv 1581	. 2 ⊢ Ⅎ𝑥𝜑
2		nfv 1581	. 2 ⊢ Ⅎ𝑦𝜑
3		nfv 1581	. 2 ⊢ Ⅎ𝑧𝜑
4		oprabbidv.1	. 2 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
5	1, 2, 3, 4	oprabbid 6141	1 ⊢ (𝜑 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜒})

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402  {coprab 6086

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-oprab 6089

This theorem is used by:  oprabbii  6143  mpoeq123dva  6149  mpoeq3dva  6152  resoprab2  6185  erovlem  6901