| 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 5974 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴)) | |
| 2 | oveq1 5974 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵)) | |
| 3 | 1, 2 | breq12d 4072 | . . 3 ⊢ (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
| 4 | 3 | bibi2d 232 | . 2 ⊢ (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))) |
| 5 | caovord.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 6 | caovord.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 7 | breq1 4062 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝑅𝑦 ↔ 𝐴𝑅𝑦)) | |
| 8 | oveq2 5975 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴)) | |
| 9 | 8 | breq1d 4069 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))) |
| 10 | 7, 9 | bibi12d 235 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))) |
| 11 | breq2 4063 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝑅𝑦 ↔ 𝐴𝑅𝐵)) | |
| 12 | oveq2 5975 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵)) | |
| 13 | 12 | breq2d 4071 | . . . . . 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 2833 | . 2 ⊢ (𝑧 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))) |
| 19 | 4, 18 | vtoclga 2844 | 1 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2178 Vcvv 2776 class class class wbr 4059 (class class class)co 5967 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-rex 2492 df-v 2778 df-un 3178 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-br 4060 df-iota 5251 df-fv 5298 df-ov 5970 |
| This theorem is referenced by: caovord2 6142 caovord3 6143 |
| Copyright terms: Public domain | W3C validator |