Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > caovord3d | GIF version |
Description: Ordering law. (Contributed by Mario Carneiro, 30-Dec-2014.) |
Ref | Expression |
---|---|
caovordg.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) |
caovordd.2 | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
caovordd.3 | ⊢ (𝜑 → 𝐵 ∈ 𝑆) |
caovordd.4 | ⊢ (𝜑 → 𝐶 ∈ 𝑆) |
caovord2d.com | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥)) |
caovord3d.5 | ⊢ (𝜑 → 𝐷 ∈ 𝑆) |
Ref | Expression |
---|---|
caovord3d | ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐶𝐹𝐷) → (𝐴𝑅𝐶 ↔ 𝐷𝑅𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1 3985 | . 2 ⊢ ((𝐴𝐹𝐵) = (𝐶𝐹𝐷) → ((𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵) ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵))) | |
2 | caovordg.1 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) | |
3 | caovordd.2 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
4 | caovordd.4 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑆) | |
5 | caovordd.3 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
6 | caovord2d.com | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥)) | |
7 | 2, 3, 4, 5, 6 | caovord2d 6011 | . . 3 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ (𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵))) |
8 | caovord3d.5 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑆) | |
9 | 2, 8, 5, 4 | caovordd 6010 | . . 3 ⊢ (𝜑 → (𝐷𝑅𝐵 ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵))) |
10 | 7, 9 | bibi12d 234 | . 2 ⊢ (𝜑 → ((𝐴𝑅𝐶 ↔ 𝐷𝑅𝐵) ↔ ((𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵) ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))) |
11 | 1, 10 | syl5ibr 155 | 1 ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐶𝐹𝐷) → (𝐴𝑅𝐶 ↔ 𝐷𝑅𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 class class class wbr 3982 (class class class)co 5842 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-un 3120 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-iota 5153 df-fv 5196 df-ov 5845 |
This theorem is referenced by: ordpipqqs 7315 ltsrprg 7688 |
Copyright terms: Public domain | W3C validator |