![]() |
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 7661 | . 2 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
5 | caovord2.3 | . . . 4 ⊢ 𝐶 ∈ V | |
6 | caovord2.com | . . . 4 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥) | |
7 | 5, 1, 6 | caovcom 7647 | . . 3 ⊢ (𝐶𝐹𝐴) = (𝐴𝐹𝐶) |
8 | 5, 2, 6 | caovcom 7647 | . . 3 ⊢ (𝐶𝐹𝐵) = (𝐵𝐹𝐶) |
9 | 7, 8 | breq12i 5175 | . 2 ⊢ ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶)) |
10 | 4, 9 | bitrdi 287 | 1 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐶)𝑅(𝐵𝐹𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 = wceq 1537 ∈ wcel 2108 Vcvv 3488 class class class wbr 5166 (class class class)co 7448 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-iota 6525 df-fv 6581 df-ov 7451 |
This theorem is referenced by: caovord3 7663 genpnmax 11076 addclprlem1 11085 mulclprlem 11088 distrlem4pr 11095 ltexprlem6 11110 reclem3pr 11118 ltsosr 11163 |
Copyright terms: Public domain | W3C validator |