Theorem caovcomd 7617

Description: Convert an operation commutative law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.)

Hypotheses

Ref	Expression
caovcomg.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
caovcomd.2	⊢ (𝜑 → 𝐴 ∈ 𝑆)
caovcomd.3	⊢ (𝜑 → 𝐵 ∈ 𝑆)

Assertion

Ref	Expression
caovcomd	⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))

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

Proof of Theorem caovcomd

Step	Hyp	Ref	Expression
1		id 22	. 2 ⊢ (𝜑 → 𝜑)
2		caovcomd.2	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
3		caovcomd.3	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝑆)
4		caovcomg.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
5	4	caovcomg 7616	. 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))
6	1, 2, 3, 5	syl12anc 835	1 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1533   ∈ wcel 2098  (class class class)co 7419

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ral 3051  df-rab 3419  df-v 3463  df-dif 3947  df-un 3949  df-ss 3961  df-nul 4323  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-br 5150  df-iota 6501  df-fv 6557  df-ov 7422

This theorem is referenced by:  caovcanrd  7624  caovord2d  7630  caovdir2d  7637  caov32d  7641  caov12d  7642  caov31d  7643  caov411d  7646  caov42d  7647  seqf1olem2a  14041