![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > caovord2 | Structured version Visualization version GIF version |
Description: Operation ordering law with commuted arguments. (Contributed by NM, 27-Feb-1996.) |
Ref | Expression |
---|---|
caovord.1 | ⊢ 𝐴 ∈ V |
caovord.2 | ⊢ 𝐵 ∈ V |
caovord.3 | ⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) |
caovord2.3 | ⊢ 𝐶 ∈ V |
caovord2.com | ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥) |
Ref | Expression |
---|---|
caovord2 | ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caovord.1 | . . 3 ⊢ 𝐴 ∈ V | |
2 | caovord.2 | . . 3 ⊢ 𝐵 ∈ V | |
3 | caovord.3 | . . 3 ⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) | |
4 | 1, 2, 3 | caovord 7598 | . 2 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
5 | caovord2.3 | . . . 4 ⊢ 𝐶 ∈ V | |
6 | caovord2.com | . . . 4 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥) | |
7 | 5, 1, 6 | caovcom 7584 | . . 3 ⊢ (𝐶𝐹𝐴) = (𝐴𝐹𝐶) |
8 | 5, 2, 6 | caovcom 7584 | . . 3 ⊢ (𝐶𝐹𝐵) = (𝐵𝐹𝐶) |
9 | 7, 8 | breq12i 5147 | . 2 ⊢ ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶)) |
10 | 4, 9 | bitrdi 286 | 1 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1541 ∈ wcel 2106 Vcvv 3470 class class class wbr 5138 (class class class)co 7390 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-ral 3061 df-rab 3430 df-v 3472 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4520 df-sn 4620 df-pr 4622 df-op 4626 df-uni 4899 df-br 5139 df-iota 6481 df-fv 6537 df-ov 7393 |
This theorem is referenced by: caovord3 7600 genpnmax 10981 addclprlem1 10990 mulclprlem 10993 distrlem4pr 11000 ltexprlem6 11015 reclem3pr 11023 ltsosr 11068 |
Copyright terms: Public domain | W3C validator |