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

Theorem posi 17554
Description: Lemma for poset properties. (Contributed by NM, 11-Sep-2011.)
Hypotheses
Ref Expression
posi.b 𝐵 = (Base‘𝐾)
posi.l = (le‘𝐾)
Assertion
Ref Expression
posi ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 𝑋 ∧ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍)))

Proof of Theorem posi
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 posi.b . . . 4 𝐵 = (Base‘𝐾)
2 posi.l . . . 4 = (le‘𝐾)
31, 2ispos 17551 . . 3 (𝐾 ∈ Poset ↔ (𝐾 ∈ V ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑥) → 𝑥 = 𝑦) ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
43simprbi 499 . 2 (𝐾 ∈ Poset → ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑥) → 𝑥 = 𝑦) ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)))
5 breq1 5062 . . . . 5 (𝑥 = 𝑋 → (𝑥 𝑥𝑋 𝑥))
6 breq2 5063 . . . . 5 (𝑥 = 𝑋 → (𝑋 𝑥𝑋 𝑋))
75, 6bitrd 281 . . . 4 (𝑥 = 𝑋 → (𝑥 𝑥𝑋 𝑋))
8 breq1 5062 . . . . . 6 (𝑥 = 𝑋 → (𝑥 𝑦𝑋 𝑦))
9 breq2 5063 . . . . . 6 (𝑥 = 𝑋 → (𝑦 𝑥𝑦 𝑋))
108, 9anbi12d 632 . . . . 5 (𝑥 = 𝑋 → ((𝑥 𝑦𝑦 𝑥) ↔ (𝑋 𝑦𝑦 𝑋)))
11 eqeq1 2825 . . . . 5 (𝑥 = 𝑋 → (𝑥 = 𝑦𝑋 = 𝑦))
1210, 11imbi12d 347 . . . 4 (𝑥 = 𝑋 → (((𝑥 𝑦𝑦 𝑥) → 𝑥 = 𝑦) ↔ ((𝑋 𝑦𝑦 𝑋) → 𝑋 = 𝑦)))
138anbi1d 631 . . . . 5 (𝑥 = 𝑋 → ((𝑥 𝑦𝑦 𝑧) ↔ (𝑋 𝑦𝑦 𝑧)))
14 breq1 5062 . . . . 5 (𝑥 = 𝑋 → (𝑥 𝑧𝑋 𝑧))
1513, 14imbi12d 347 . . . 4 (𝑥 = 𝑋 → (((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧) ↔ ((𝑋 𝑦𝑦 𝑧) → 𝑋 𝑧)))
167, 12, 153anbi123d 1432 . . 3 (𝑥 = 𝑋 → ((𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑥) → 𝑥 = 𝑦) ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)) ↔ (𝑋 𝑋 ∧ ((𝑋 𝑦𝑦 𝑋) → 𝑋 = 𝑦) ∧ ((𝑋 𝑦𝑦 𝑧) → 𝑋 𝑧))))
17 breq2 5063 . . . . . 6 (𝑦 = 𝑌 → (𝑋 𝑦𝑋 𝑌))
18 breq1 5062 . . . . . 6 (𝑦 = 𝑌 → (𝑦 𝑋𝑌 𝑋))
1917, 18anbi12d 632 . . . . 5 (𝑦 = 𝑌 → ((𝑋 𝑦𝑦 𝑋) ↔ (𝑋 𝑌𝑌 𝑋)))
20 eqeq2 2833 . . . . 5 (𝑦 = 𝑌 → (𝑋 = 𝑦𝑋 = 𝑌))
2119, 20imbi12d 347 . . . 4 (𝑦 = 𝑌 → (((𝑋 𝑦𝑦 𝑋) → 𝑋 = 𝑦) ↔ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌)))
22 breq1 5062 . . . . . 6 (𝑦 = 𝑌 → (𝑦 𝑧𝑌 𝑧))
2317, 22anbi12d 632 . . . . 5 (𝑦 = 𝑌 → ((𝑋 𝑦𝑦 𝑧) ↔ (𝑋 𝑌𝑌 𝑧)))
2423imbi1d 344 . . . 4 (𝑦 = 𝑌 → (((𝑋 𝑦𝑦 𝑧) → 𝑋 𝑧) ↔ ((𝑋 𝑌𝑌 𝑧) → 𝑋 𝑧)))
2521, 243anbi23d 1435 . . 3 (𝑦 = 𝑌 → ((𝑋 𝑋 ∧ ((𝑋 𝑦𝑦 𝑋) → 𝑋 = 𝑦) ∧ ((𝑋 𝑦𝑦 𝑧) → 𝑋 𝑧)) ↔ (𝑋 𝑋 ∧ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 𝑌𝑌 𝑧) → 𝑋 𝑧))))
26 breq2 5063 . . . . . 6 (𝑧 = 𝑍 → (𝑌 𝑧𝑌 𝑍))
2726anbi2d 630 . . . . 5 (𝑧 = 𝑍 → ((𝑋 𝑌𝑌 𝑧) ↔ (𝑋 𝑌𝑌 𝑍)))
28 breq2 5063 . . . . 5 (𝑧 = 𝑍 → (𝑋 𝑧𝑋 𝑍))
2927, 28imbi12d 347 . . . 4 (𝑧 = 𝑍 → (((𝑋 𝑌𝑌 𝑧) → 𝑋 𝑧) ↔ ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍)))
30293anbi3d 1438 . . 3 (𝑧 = 𝑍 → ((𝑋 𝑋 ∧ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 𝑌𝑌 𝑧) → 𝑋 𝑧)) ↔ (𝑋 𝑋 ∧ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍))))
3116, 25, 30rspc3v 3636 . 2 ((𝑋𝐵𝑌𝐵𝑍𝐵) → (∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑥) → 𝑥 = 𝑦) ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)) → (𝑋 𝑋 ∧ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍))))
324, 31mpan9 509 1 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 𝑋 ∧ ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌) ∧ ((𝑋 𝑌𝑌 𝑍) → 𝑋 𝑍)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1533  wcel 2110  wral 3138  Vcvv 3495   class class class wbr 5059  cfv 6350  Basecbs 16477  lecple 16566  Posetcpo 17544
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-nul 5203
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-br 5060  df-iota 6309  df-fv 6358  df-poset 17550
This theorem is referenced by:  posasymb  17556  postr  17557
  Copyright terms: Public domain W3C validator