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

Theorem pltval3 18491
Description: Alternate expression for the "less than" relation. (dfpss3 4037 analog.) (Contributed by NM, 4-Nov-2011.)
Hypotheses
Ref Expression
pleval2.b 𝐵 = (Base‘𝐾)
pleval2.l ≤ = (le‘𝐾)
pleval2.s < = (lt‘𝐾)
Assertion
Ref Expression
pltval3 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 ↔ (𝑋 ≤ 𝑌 ∧ ¬ 𝑌 ≤ 𝑋)))

Proof of Theorem pltval3
StepHypRef Expression
1 pleval2.l . . 3 ≤ = (le‘𝐾)
2 pleval2.s . . 3 < = (lt‘𝐾)
31, 2pltval 18484 . 2 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 ↔ (𝑋 ≤ 𝑌 ∧ 𝑋 ≠ 𝑌)))
4 pleval2.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
54, 1posref 18472 . . . . . . . 8 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋)
653adant3 1150 . . . . . . 7 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ≤ 𝑋)
7 breq1 5106 . . . . . . 7 (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑌 ≤ 𝑋))
86, 7syl5ibcom 248 . . . . . 6 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 𝑌 → 𝑌 ≤ 𝑋))
98adantr 486 . . . . 5 (((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 = 𝑌 → 𝑌 ≤ 𝑋))
104, 1posasymb 18473 . . . . . . 7 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) ↔ 𝑋 = 𝑌))
1110biimpd 232 . . . . . 6 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑋) → 𝑋 = 𝑌))
1211expdimp 458 . . . . 5 (((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑌 ≤ 𝑋 → 𝑋 = 𝑌))
139, 12impbid 215 . . . 4 (((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 = 𝑌 ↔ 𝑌 ≤ 𝑋))
1413necon3abid 2992 . . 3 (((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 ≠ 𝑌 ↔ ¬ 𝑌 ≤ 𝑋))
1514pm5.32da 590 . 2 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ 𝑋 ≠ 𝑌) ↔ (𝑋 ≤ 𝑌 ∧ ¬ 𝑌 ≤ 𝑋)))
163, 15bitrd 282 1 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 ↔ (𝑋 ≤ 𝑌 ∧ ¬ 𝑌 ≤ 𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   class class class wbr 5103  ‘cfv 6531  Basecbs 17367  lecple 17415  Posetcpo 18461  ltcplt 18462
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-proset 18448  df-poset 18467  df-plt 18482
This theorem is used by:  tltnle  18574  opltcon3b  40229
  Copyright terms: Public domain W3C validator