Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  oplecon3b Structured version   Visualization version   GIF version

Theorem oplecon3b 38728
Description: Contraposition law for orthoposets. (chsscon3 31354 analog.) (Contributed by NM, 4-Nov-2011.)
Hypotheses
Ref Expression
opcon3.b 𝐡 = (Baseβ€˜πΎ)
opcon3.l ≀ = (leβ€˜πΎ)
opcon3.o βŠ₯ = (ocβ€˜πΎ)
Assertion
Ref Expression
oplecon3b ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ (𝑋 ≀ π‘Œ ↔ ( βŠ₯ β€˜π‘Œ) ≀ ( βŠ₯ β€˜π‘‹)))

Proof of Theorem oplecon3b
StepHypRef Expression
1 opcon3.b . . 3 𝐡 = (Baseβ€˜πΎ)
2 opcon3.l . . 3 ≀ = (leβ€˜πΎ)
3 opcon3.o . . 3 βŠ₯ = (ocβ€˜πΎ)
41, 2, 3oplecon3 38727 . 2 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ (𝑋 ≀ π‘Œ β†’ ( βŠ₯ β€˜π‘Œ) ≀ ( βŠ₯ β€˜π‘‹)))
5 simp1 1133 . . . 4 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ 𝐾 ∈ OP)
61, 3opoccl 38722 . . . . 5 ((𝐾 ∈ OP ∧ π‘Œ ∈ 𝐡) β†’ ( βŠ₯ β€˜π‘Œ) ∈ 𝐡)
763adant2 1128 . . . 4 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ ( βŠ₯ β€˜π‘Œ) ∈ 𝐡)
81, 3opoccl 38722 . . . . 5 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡) β†’ ( βŠ₯ β€˜π‘‹) ∈ 𝐡)
983adant3 1129 . . . 4 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ ( βŠ₯ β€˜π‘‹) ∈ 𝐡)
101, 2, 3oplecon3 38727 . . . 4 ((𝐾 ∈ OP ∧ ( βŠ₯ β€˜π‘Œ) ∈ 𝐡 ∧ ( βŠ₯ β€˜π‘‹) ∈ 𝐡) β†’ (( βŠ₯ β€˜π‘Œ) ≀ ( βŠ₯ β€˜π‘‹) β†’ ( βŠ₯ β€˜( βŠ₯ β€˜π‘‹)) ≀ ( βŠ₯ β€˜( βŠ₯ β€˜π‘Œ))))
115, 7, 9, 10syl3anc 1368 . . 3 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ (( βŠ₯ β€˜π‘Œ) ≀ ( βŠ₯ β€˜π‘‹) β†’ ( βŠ₯ β€˜( βŠ₯ β€˜π‘‹)) ≀ ( βŠ₯ β€˜( βŠ₯ β€˜π‘Œ))))
121, 3opococ 38723 . . . . 5 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡) β†’ ( βŠ₯ β€˜( βŠ₯ β€˜π‘‹)) = 𝑋)
13123adant3 1129 . . . 4 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ ( βŠ₯ β€˜( βŠ₯ β€˜π‘‹)) = 𝑋)
141, 3opococ 38723 . . . . 5 ((𝐾 ∈ OP ∧ π‘Œ ∈ 𝐡) β†’ ( βŠ₯ β€˜( βŠ₯ β€˜π‘Œ)) = π‘Œ)
15143adant2 1128 . . . 4 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ ( βŠ₯ β€˜( βŠ₯ β€˜π‘Œ)) = π‘Œ)
1613, 15breq12d 5156 . . 3 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ (( βŠ₯ β€˜( βŠ₯ β€˜π‘‹)) ≀ ( βŠ₯ β€˜( βŠ₯ β€˜π‘Œ)) ↔ 𝑋 ≀ π‘Œ))
1711, 16sylibd 238 . 2 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ (( βŠ₯ β€˜π‘Œ) ≀ ( βŠ₯ β€˜π‘‹) β†’ 𝑋 ≀ π‘Œ))
184, 17impbid 211 1 ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐡 ∧ π‘Œ ∈ 𝐡) β†’ (𝑋 ≀ π‘Œ ↔ ( βŠ₯ β€˜π‘Œ) ≀ ( βŠ₯ β€˜π‘‹)))
Colors of variables: wff setvar class
Syntax hints:   β†’ wi 4   ↔ wb 205   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098   class class class wbr 5143  β€˜cfv 6543  Basecbs 17179  lecple 17239  occoc 17240  OPcops 38700
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696  ax-nul 5301
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ne 2931  df-ral 3052  df-rab 3420  df-v 3465  df-dif 3942  df-un 3944  df-ss 3956  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-br 5144  df-dm 5682  df-iota 6495  df-fv 6551  df-ov 7419  df-oposet 38704
This theorem is referenced by:  oplecon1b  38729  opltcon3b  38732  oldmm1  38745  omllaw4  38774  cvrcmp2  38812  glbconN  38905  glbconNOLD  38906  lhpmod2i2  39567  lhpmod6i1  39568  lhprelat3N  39569  dochss  40894
  Copyright terms: Public domain W3C validator