Theorem caovcom 7348

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

Syntax hints:   ∧ wa 398   = wceq 1536   ∈ wcel 2113  Vcvv 3497  (class class class)co 7159

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rab 3150  df-v 3499  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-br 5070  df-iota 6317  df-fv 6366  df-ov 7162

This theorem is referenced by:  caovord2  7363  caov32  7378  caov12  7379  caov42  7384  caovdir  7385  caovmo  7388  ecopovsym  8402  ecopover  8404  genpcl  10433