Theorem caovord2 7654

Description: Operation ordering law with commuted arguments. (Contributed by NM, 27-Feb-1996.)

Hypotheses

Ref	Expression
caovord.1	⊢ 𝐴 ∈ V
caovord.2	⊢ 𝐵 ∈ V
caovord.3	⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
caovord2.3	⊢ 𝐶 ∈ V
caovord2.com	⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)

Assertion

Ref	Expression
caovord2	⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovord2

Step	Hyp	Ref	Expression
1		caovord.1	. . 3 ⊢ 𝐴 ∈ V
2		caovord.2	. . 3 ⊢ 𝐵 ∈ V
3		caovord.3	. . 3 ⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
4	1, 2, 3	caovord 7653	. 2 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
5		caovord2.3	. . . 4 ⊢ 𝐶 ∈ V
6		caovord2.com	. . . 4 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)
7	5, 1, 6	caovcom 7639	. . 3 ⊢ (𝐶𝐹𝐴) = (𝐴𝐹𝐶)
8	5, 2, 6	caovcom 7639	. . 3 ⊢ (𝐶𝐹𝐵) = (𝐵𝐹𝐶)
9	7, 8	breq12i 5115	. 2 ⊢ ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶))
10	4, 9	bitrdi 290	1 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  Vcvv 3454   class class class wbr 5106  (class class class)co 7440

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6509  df-fv 6563  df-ov 7443

This theorem is used by:  caovord3  7655  genpnmax  11116  addclprlem1  11125  mulclprlem  11128  distrlem4pr  11135  ltexprlem6  11150  reclem3pr  11158  ltsosr  11203