ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sowlin GIF version

Theorem sowlin 4465
Description: A strict order relation satisfies weak linearity. (Contributed by Jim Kingdon, 6-Oct-2018.)
Assertion
Ref Expression
sowlin ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝐵𝑅𝐶 → (𝐵𝑅𝐷 ∨ 𝐷𝑅𝐶)))

Proof of Theorem sowlin
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 4133 . . . . 5 (𝑥 = 𝐵 → (𝑥𝑅𝑦 ↔ 𝐵𝑅𝑦))
2 breq1 4133 . . . . . 6 (𝑥 = 𝐵 → (𝑥𝑅𝑧 ↔ 𝐵𝑅𝑧))
32orbi1d 803 . . . . 5 (𝑥 = 𝐵 → ((𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦) ↔ (𝐵𝑅𝑧 ∨ 𝑧𝑅𝑦)))
41, 3imbi12d 234 . . . 4 (𝑥 = 𝐵 → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝐵𝑅𝑦 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝑦))))
54imbi2d 230 . . 3 (𝑥 = 𝐵 → ((𝑅 Or 𝐴 → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))) ↔ (𝑅 Or 𝐴 → (𝐵𝑅𝑦 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝑦)))))
6 breq2 4134 . . . . 5 (𝑦 = 𝐶 → (𝐵𝑅𝑦 ↔ 𝐵𝑅𝐶))
7 breq2 4134 . . . . . 6 (𝑦 = 𝐶 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝐶))
87orbi2d 802 . . . . 5 (𝑦 = 𝐶 → ((𝐵𝑅𝑧 ∨ 𝑧𝑅𝑦) ↔ (𝐵𝑅𝑧 ∨ 𝑧𝑅𝐶)))
96, 8imbi12d 234 . . . 4 (𝑦 = 𝐶 → ((𝐵𝑅𝑦 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝐵𝑅𝐶 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝐶))))
109imbi2d 230 . . 3 (𝑦 = 𝐶 → ((𝑅 Or 𝐴 → (𝐵𝑅𝑦 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝑦))) ↔ (𝑅 Or 𝐴 → (𝐵𝑅𝐶 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝐶)))))
11 breq2 4134 . . . . . 6 (𝑧 = 𝐷 → (𝐵𝑅𝑧 ↔ 𝐵𝑅𝐷))
12 breq1 4133 . . . . . 6 (𝑧 = 𝐷 → (𝑧𝑅𝐶 ↔ 𝐷𝑅𝐶))
1311, 12orbi12d 805 . . . . 5 (𝑧 = 𝐷 → ((𝐵𝑅𝑧 ∨ 𝑧𝑅𝐶) ↔ (𝐵𝑅𝐷 ∨ 𝐷𝑅𝐶)))
1413imbi2d 230 . . . 4 (𝑧 = 𝐷 → ((𝐵𝑅𝐶 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝐶)) ↔ (𝐵𝑅𝐶 → (𝐵𝑅𝐷 ∨ 𝐷𝑅𝐶))))
1514imbi2d 230 . . 3 (𝑧 = 𝐷 → ((𝑅 Or 𝐴 → (𝐵𝑅𝐶 → (𝐵𝑅𝑧 ∨ 𝑧𝑅𝐶))) ↔ (𝑅 Or 𝐴 → (𝐵𝑅𝐶 → (𝐵𝑅𝐷 ∨ 𝐷𝑅𝐶)))))
16 df-iso 4442 . . . . 5 (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
17 3anass 1013 . . . . . . 7 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)))
18 rsp 2597 . . . . . . . . 9 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) → (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
19 rsp2 2600 . . . . . . . . 9 (∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) → ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
2018, 19syl6 33 . . . . . . . 8 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) → (𝑥 ∈ 𝐴 → ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)))))
2120impd 254 . . . . . . 7 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
2217, 21biimtrid 152 . . . . . 6 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
2322adantl 277 . . . . 5 ((𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
2416, 23sylbi 121 . . . 4 (𝑅 Or 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
2524com12 30 . . 3 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑅 Or 𝐴 → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
265, 10, 15, 25vtocl3ga 2893 . 2 ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (𝑅 Or 𝐴 → (𝐵𝑅𝐶 → (𝐵𝑅𝐷 ∨ 𝐷𝑅𝐶))))
2726impcom 125 1 ((𝑅 Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝐵𝑅𝐶 → (𝐵𝑅𝐷 ∨ 𝐷𝑅𝐶)))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∨ wo 720   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528   class class class wbr 4130   Po wpo 4439   Or wor 4440
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-iso 4442
This theorem is used by:  sotri2  5185  sotri3  5186  suplub2ti  7342  addextpr  7989  cauappcvgprlemloc  8020  caucvgprlemloc  8043  caucvgprprlemloc  8071  caucvgprprlemaddq  8076  ltsosr  8132  suplocsrlem  8176  axpre-ltwlin  8251  xrlelttr  10219  xrltletr  10220  xrletr  10221  xrmaxiflemlub  12033
  Copyright terms: Public domain W3C validator