Theorem caovcomd 6830

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 6829	. 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))
6	1, 2, 3, 5	syl12anc 1324	1 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  (class class class)co 6650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653

This theorem is referenced by:  caovcanrd  6837  caovord2d  6843  caovdir2d  6850  caov32d  6854  caov12d  6855  caov31d  6856  caov411d  6859  caov42d  6860  seqf1olem2a  12839