MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isso2i Structured version   Visualization version   GIF version

Theorem isso2i 5603
Description: Deduce strict ordering from its properties. (Contributed by NM, 29-Jan-1996.) (Revised by Mario Carneiro, 9-Jul-2014.)
Hypotheses
Ref Expression
isso2i.1 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
isso2i.2 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
Assertion
Ref Expression
isso2i 𝑅 Or 𝐴
Distinct variable groups:   𝑥,𝑦,𝑧,𝑅   𝑥,𝐴,𝑦,𝑧

Proof of Theorem isso2i
StepHypRef Expression
1 equid 2047 . . . . 5 𝑥 = 𝑥
21orci 879 . . . 4 (𝑥 = 𝑥 ∨ 𝑥𝑅𝑥)
3 nfv 1949 . . . . 5 Ⅎ𝑦((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑥 = 𝑥 ∨ 𝑥𝑅𝑥) ↔ ¬ 𝑥𝑅𝑥))
4 eleq1w 2847 . . . . . . 7 (𝑦 = 𝑥 → (𝑦 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴))
54anbi2d 642 . . . . . 6 (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)))
6 equequ2 2061 . . . . . . . 8 (𝑦 = 𝑥 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑥))
7 breq1 5111 . . . . . . . 8 (𝑦 = 𝑥 → (𝑦𝑅𝑥 ↔ 𝑥𝑅𝑥))
86, 7orbi12d 932 . . . . . . 7 (𝑦 = 𝑥 → ((𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑥 = 𝑥 ∨ 𝑥𝑅𝑥)))
9 breq2 5112 . . . . . . . 8 (𝑦 = 𝑥 → (𝑥𝑅𝑦 ↔ 𝑥𝑅𝑥))
109notbid 321 . . . . . . 7 (𝑦 = 𝑥 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑅𝑥))
118, 10bibi12d 348 . . . . . 6 (𝑦 = 𝑥 → (((𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ¬ 𝑥𝑅𝑦) ↔ ((𝑥 = 𝑥 ∨ 𝑥𝑅𝑥) ↔ ¬ 𝑥𝑅𝑥)))
125, 11imbi12d 347 . . . . 5 (𝑦 = 𝑥 → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ¬ 𝑥𝑅𝑦)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑥 = 𝑥 ∨ 𝑥𝑅𝑥) ↔ ¬ 𝑥𝑅𝑥))))
13 isso2i.1 . . . . . 6 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
1413con2bid 357 . . . . 5 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ¬ 𝑥𝑅𝑦))
153, 12, 14chvarfv 2280 . . . 4 ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑥 = 𝑥 ∨ 𝑥𝑅𝑥) ↔ ¬ 𝑥𝑅𝑥))
162, 15mpbii 236 . . 3 ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥𝑅𝑥)
1716anidms 577 . 2 (𝑥 ∈ 𝐴 → ¬ 𝑥𝑅𝑥)
18 isso2i.2 . 2 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
1914biimprd 251 . . . 4 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (¬ 𝑥𝑅𝑦 → (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
2019orrd 877 . . 3 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ∨ (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
21 3orass 1106 . . 3 ((𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑥𝑅𝑦 ∨ (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
2220, 21sylibr 237 . 2 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
2317, 18, 22issoi 5602 1 𝑅 Or 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   ∧ w3a 1103   ∈ wcel 2147   class class class wbr 5108   Or wor 5565
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-po 5566  df-so 5567
This theorem is used by:  ltsonq  11093  ltsosr  11218  ltso  11429  xrltso  13310
  Copyright terms: Public domain W3C validator