Theorem oprabbii 6861

Description: Equivalent wff's yield equal operation class abstractions. (Contributed by NM, 28-May-1995.) (Revised by David Abernethy, 19-Jun-2012.)

Hypothesis

Ref	Expression
oprabbii.1	⊢ (𝜑 ↔ 𝜓)

Assertion

Ref	Expression
oprabbii	⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}

Distinct variable groups:   𝑥,𝑧   𝑦,𝑧

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

Proof of Theorem oprabbii

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2771	. 2 ⊢ 𝑤 = 𝑤
2		oprabbii.1	. . . 4 ⊢ (𝜑 ↔ 𝜓)
3	2	a1i 11	. . 3 ⊢ (𝑤 = 𝑤 → (𝜑 ↔ 𝜓))
4	3	oprabbidv 6860	. 2 ⊢ (𝑤 = 𝑤 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓})
5	1, 4	ax-mp 5	1 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}

Syntax hints:   ↔ wb 196   = wceq 1631  {coprab 6797

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-ext 2751

This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-oprab 6800

This theorem is referenced by:  oprab4  6877  mpt2v  6901  dfxp3  7384  tposmpt2  7545  addsrpr  10102  mulsrpr  10103  addcnsr  10162  mulcnsr  10163  joinfval2  17210  meetfval2  17224  dfxrn2  34478