| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > caovordg | 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 2613 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) |
| 3 | breq1 4085 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝑅𝑦 ↔ 𝐴𝑅𝑦)) | |
| 4 | oveq2 6008 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴)) | |
| 5 | 4 | breq1d 4092 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))) |
| 6 | 3, 5 | bibi12d 235 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))) |
| 7 | breq2 4086 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝑅𝑦 ↔ 𝐴𝑅𝐵)) | |
| 8 | oveq2 6008 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵)) | |
| 9 | 8 | breq2d 4094 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))) |
| 10 | 7, 9 | bibi12d 235 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))) |
| 11 | oveq1 6007 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴)) | |
| 12 | oveq1 6007 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵)) | |
| 13 | 11, 12 | breq12d 4095 | . . . 4 ⊢ (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
| 14 | 13 | bibi2d 232 | . . 3 ⊢ (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))) |
| 15 | 6, 10, 14 | rspc3v 2923 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))) |
| 16 | 2, 15 | mpan9 281 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ∀wral 2508 class class class wbr 4082 (class class class)co 6000 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-un 3201 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-iota 5277 df-fv 5325 df-ov 6003 |
| This theorem is referenced by: caovordd 6173 |
| Copyright terms: Public domain | W3C validator |