Theorem caovcom 7469

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 471	. 2 ⊢ (𝐴 ∈ V ∧ 𝐵 ∈ V)
4		caovcom.3	. . . 4 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)
5	4	a1i 11	. . 3 ⊢ ((𝐴 ∈ V ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
6	5	caovcomg 7467	. 2 ⊢ ((𝐴 ∈ V ∧ (𝐴 ∈ V ∧ 𝐵 ∈ V)) → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))
7	1, 3, 6	mp2an 689	1 ⊢ (𝐴𝐹𝐵) = (𝐵𝐹𝐴)

Syntax hints:   ∧ wa 396   = wceq 1539   ∈ wcel 2106  Vcvv 3432  (class class class)co 7275

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-iota 6391  df-fv 6441  df-ov 7278

This theorem is referenced by:  caovord2  7484  caov32  7499  caov12  7500  caov42  7505  caovdir  7506  caovmo  7509  ecopovsym  8608  ecopover  8610  genpcl  10764