Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sotri2 | GIF version |
Description: A transitivity relation. (Read ¬ B < A and B < C implies A < C .) (Contributed by Mario Carneiro, 10-May-2013.) |
Ref | Expression |
---|---|
soi.1 | ⊢ 𝑅 Or 𝑆 |
soi.2 | ⊢ 𝑅 ⊆ (𝑆 × 𝑆) |
Ref | Expression |
---|---|
sotri2 | ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp2 998 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → ¬ 𝐵𝑅𝐴) | |
2 | soi.2 | . . . . . . 7 ⊢ 𝑅 ⊆ (𝑆 × 𝑆) | |
3 | 2 | brel 4672 | . . . . . 6 ⊢ (𝐵𝑅𝐶 → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) |
4 | 3 | 3ad2ant3 1020 | . . . . 5 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) |
5 | simp1 997 | . . . . 5 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → 𝐴 ∈ 𝑆) | |
6 | df-3an 980 | . . . . 5 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ↔ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ 𝐴 ∈ 𝑆)) | |
7 | 4, 5, 6 | sylanbrc 417 | . . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) |
8 | simp3 999 | . . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶) | |
9 | soi.1 | . . . . 5 ⊢ 𝑅 Or 𝑆 | |
10 | sowlin 4314 | . . . . 5 ⊢ ((𝑅 Or 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) → (𝐵𝑅𝐶 → (𝐵𝑅𝐴 ∨ 𝐴𝑅𝐶))) | |
11 | 9, 10 | mpan 424 | . . . 4 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (𝐵𝑅𝐶 → (𝐵𝑅𝐴 ∨ 𝐴𝑅𝐶))) |
12 | 7, 8, 11 | sylc 62 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → (𝐵𝑅𝐴 ∨ 𝐴𝑅𝐶)) |
13 | 12 | ord 724 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → (¬ 𝐵𝑅𝐴 → 𝐴𝑅𝐶)) |
14 | 1, 13 | mpd 13 | 1 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 708 ∧ w3a 978 ∈ wcel 2146 ⊆ wss 3127 class class class wbr 3998 Or wor 4289 × cxp 4618 |
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-in2 615 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-14 2149 ax-ext 2157 ax-sep 4116 ax-pow 4169 ax-pr 4203 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1459 df-sb 1761 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ral 2458 df-rex 2459 df-v 2737 df-un 3131 df-in 3133 df-ss 3140 df-pw 3574 df-sn 3595 df-pr 3596 df-op 3598 df-br 3999 df-opab 4060 df-iso 4291 df-xp 4626 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |