| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > caovord | GIF version | ||
| Description: Convert an operation ordering law to class notation. (Contributed by NM, 19-Feb-1996.) |
| Ref | Expression |
|---|---|
| caovord.1 | ⊢ 𝐴 ∈ V |
| caovord.2 | ⊢ 𝐵 ∈ V |
| caovord.3 | ⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) |
| Ref | Expression |
|---|---|
| caovord | ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 6056 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴)) | |
| 2 | oveq1 6056 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵)) | |
| 3 | 1, 2 | breq12d 4121 | . . 3 ⊢ (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
| 4 | 3 | bibi2d 232 | . 2 ⊢ (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))) |
| 5 | caovord.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 6 | caovord.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 7 | breq1 4111 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝑅𝑦 ↔ 𝐴𝑅𝑦)) | |
| 8 | oveq2 6057 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴)) | |
| 9 | 8 | breq1d 4118 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))) |
| 10 | 7, 9 | bibi12d 235 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))) |
| 11 | breq2 4112 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝑅𝑦 ↔ 𝐴𝑅𝐵)) | |
| 12 | oveq2 6057 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵)) | |
| 13 | 12 | breq2d 4120 | . . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))) |
| 14 | 11, 13 | bibi12d 235 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))) |
| 15 | 10, 14 | sylan9bb 462 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))) |
| 16 | 15 | imbi2d 230 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) ↔ (𝑧 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))) |
| 17 | caovord.3 | . . 3 ⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) | |
| 18 | 5, 6, 16, 17 | vtocl2 2869 | . 2 ⊢ (𝑧 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))) |
| 19 | 4, 18 | vtoclga 2880 | 1 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2203 Vcvv 2812 class class class wbr 4108 (class class class)co 6049 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-rex 2526 df-v 2814 df-un 3214 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-br 4109 df-iota 5311 df-fv 5359 df-ov 6052 |
| This theorem is referenced by: caovord2 6226 caovord3 6227 |
| Copyright terms: Public domain | W3C validator |