Theorem caovcom 7537

Description: Convert an operation commutative law to class notation. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 1-Jun-2013.)

Hypotheses

Ref	Expression
caovcom.1	⊢ 𝐴 ∈ V
caovcom.2	⊢ 𝐵 ∈ V
caovcom.3	⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)

Assertion

Ref	Expression
caovcom	⊢ (𝐴𝐹𝐵) = (𝐵𝐹𝐴)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦

Proof of Theorem caovcom

Step	Hyp	Ref	Expression
1		caovcom.1	. 2 ⊢ 𝐴 ∈ V
2		caovcom.2	. . 3 ⊢ 𝐵 ∈ V
3	1, 2	pm3.2i 470	. 2 ⊢ (𝐴 ∈ V ∧ 𝐵 ∈ V)
4		caovcom.3	. . . 4 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)
5	4	a1i 11	. . 3 ⊢ ((𝐴 ∈ V ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
6	5	caovcomg 7535	. 2 ⊢ ((𝐴 ∈ V ∧ (𝐴 ∈ V ∧ 𝐵 ∈ V)) → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))
7	1, 3, 6	mp2an 692	1 ⊢ (𝐴𝐹𝐵) = (𝐵𝐹𝐴)

Syntax hints:   ∧ wa 395   = wceq 1540   ∈ wcel 2109  Vcvv 3433  (class class class)co 7340

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rab 3393  df-v 3435  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5089  df-iota 6432  df-fv 6484  df-ov 7343

This theorem is referenced by:  caovord2  7552  caov32  7567  caov12  7568  caov42  7573  caovdir  7574  caovmo  7577  ecopovsym  8737  ecopover  8739  genpcl  10890