Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > so2nr | GIF version |
Description: A strict order relation has no 2-cycle loops. (Contributed by NM, 21-Jan-1996.) |
Ref | Expression |
---|---|
so2nr | ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sopo 4068 | . 2 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
2 | po2nr 4064 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐵)) | |
3 | 1, 2 | sylan 277 | 1 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐵)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 102 ∈ wcel 1433 class class class wbr 3785 Po wpo 4049 Or wor 4050 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-v 2603 df-un 2977 df-sn 3404 df-pr 3405 df-op 3407 df-br 3786 df-po 4051 df-iso 4052 |
This theorem is referenced by: sotricim 4078 cauappcvgprlemdisj 6841 cauappcvgprlemladdru 6846 cauappcvgprlemladdrl 6847 caucvgprlemnbj 6857 caucvgprprlemnbj 6883 ltnsym2 7201 |
Copyright terms: Public domain | W3C validator |