Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > caovordg | Structured version Visualization version GIF version |
Description: Convert an operation ordering law to class notation. (Contributed by NM, 19-Feb-1996.) (Revised by Mario Carneiro, 30-Dec-2014.) |
Ref | Expression |
---|---|
caovordg.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) |
Ref | Expression |
---|---|
caovordg | ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caovordg.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) | |
2 | 1 | ralrimivvva 3197 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) |
3 | breq1 5084 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝑅𝑦 ↔ 𝐴𝑅𝑦)) | |
4 | oveq2 7315 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴)) | |
5 | 4 | breq1d 5091 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))) |
6 | 3, 5 | bibi12d 346 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))) |
7 | breq2 5085 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝑅𝑦 ↔ 𝐴𝑅𝐵)) | |
8 | oveq2 7315 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵)) | |
9 | 8 | breq2d 5093 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))) |
10 | 7, 9 | bibi12d 346 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))) |
11 | oveq1 7314 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴)) | |
12 | oveq1 7314 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵)) | |
13 | 11, 12 | breq12d 5094 | . . . 4 ⊢ (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
14 | 13 | bibi2d 343 | . . 3 ⊢ (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))) |
15 | 6, 10, 14 | rspc3v 3578 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))) |
16 | 2, 15 | mpan9 508 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1087 = wceq 1539 ∈ wcel 2104 ∀wral 3062 class class class wbr 5081 (class class class)co 7307 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2707 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-clab 2714 df-cleq 2728 df-clel 2814 df-ral 3063 df-rab 3287 df-v 3439 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-iota 6410 df-fv 6466 df-ov 7310 |
This theorem is referenced by: caovordd 7512 |
Copyright terms: Public domain | W3C validator |