Theorem caovcomg 6053

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

Hypothesis

Ref	Expression
caovcomg.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))

Assertion

Ref	Expression
caovcomg	⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))

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

Proof of Theorem caovcomg

Step	Hyp	Ref	Expression
1		caovcomg.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
2	1	ralrimivva 2572	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
3		oveq1 5904	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
4		oveq2 5905	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑦𝐹𝑥) = (𝑦𝐹𝐴))
5	3, 4	eqeq12d 2204	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑦𝐹𝑥) ↔ (𝐴𝐹𝑦) = (𝑦𝐹𝐴)))
6		oveq2 5905	. . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
7		oveq1 5904	. . . 4 ⊢ (𝑦 = 𝐵 → (𝑦𝐹𝐴) = (𝐵𝐹𝐴))
8	6, 7	eqeq12d 2204	. . 3 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝑦𝐹𝐴) ↔ (𝐴𝐹𝐵) = (𝐵𝐹𝐴)))
9	5, 8	rspc2v 2869	. 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) = (𝑦𝐹𝑥) → (𝐴𝐹𝐵) = (𝐵𝐹𝐴)))
10	2, 9	mpan9 281	1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2160  ∀wral 2468  (class class class)co 5897

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-un 3148  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-iota 5196  df-fv 5243  df-ov 5900

This theorem is referenced by:  caovcomd  6054  caovcom  6055  caovlem2d  6090  caofcom  6131  seq3caopr  10516  cmncom  13258