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

Theorem isprs 18353
Description: Property of being a preordered set. (Contributed by Stefan O'Rear, 31-Jan-2015.)
Hypotheses
Ref Expression
isprs.b 𝐵 = (Base‘𝐾)
isprs.l = (le‘𝐾)
Assertion
Ref Expression
isprs (𝐾 ∈ Proset ↔ (𝐾 ∈ V ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
Distinct variable groups:   𝑥,𝐾,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥, ,𝑦,𝑧

Proof of Theorem isprs
Dummy variables 𝑓 𝑏 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6883 . . . 4 (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾))
2 fveq2 6883 . . . . 5 (𝑓 = 𝐾 → (le‘𝑓) = (le‘𝐾))
32sbceq1d 3750 . . . 4 (𝑓 = 𝐾 → ([(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ [(le‘𝐾) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
41, 3sbceqbid 3752 . . 3 (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ [(Base‘𝐾) / 𝑏][(le‘𝐾) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
5 fvex 6896 . . . 4 (Base‘𝐾) ∈ V
6 fvex 6896 . . . 4 (le‘𝐾) ∈ V
7 isprs.b . . . . . . 7 𝐵 = (Base‘𝐾)
8 eqtr3 2785 . . . . . . 7 ((𝑏 = (Base‘𝐾) ∧ 𝐵 = (Base‘𝐾)) → 𝑏 = 𝐵)
97, 8mpan2 703 . . . . . 6 (𝑏 = (Base‘𝐾) → 𝑏 = 𝐵)
10 raleq 3320 . . . . . . . 8 (𝑏 = 𝐵 → (∀𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
1110raleqbi1dv 3333 . . . . . . 7 (𝑏 = 𝐵 → (∀𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
1211raleqbi1dv 3333 . . . . . 6 (𝑏 = 𝐵 → (∀𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
139, 12syl 18 . . . . 5 (𝑏 = (Base‘𝐾) → (∀𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
14 isprs.l . . . . . . 7 = (le‘𝐾)
15 eqtr3 2785 . . . . . . 7 ((𝑟 = (le‘𝐾) ∧ = (le‘𝐾)) → 𝑟 = )
1614, 15mpan2 703 . . . . . 6 (𝑟 = (le‘𝐾) → 𝑟 = )
17 breq 5112 . . . . . . . . 9 (𝑟 = → (𝑥𝑟𝑥𝑥 𝑥))
18 breq 5112 . . . . . . . . . . 11 (𝑟 = → (𝑥𝑟𝑦𝑥 𝑦))
19 breq 5112 . . . . . . . . . . 11 (𝑟 = → (𝑦𝑟𝑧𝑦 𝑧))
2018, 19anbi12d 643 . . . . . . . . . 10 (𝑟 = → ((𝑥𝑟𝑦𝑦𝑟𝑧) ↔ (𝑥 𝑦𝑦 𝑧)))
21 breq 5112 . . . . . . . . . 10 (𝑟 = → (𝑥𝑟𝑧𝑥 𝑧))
2220, 21imbi12d 347 . . . . . . . . 9 (𝑟 = → (((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧) ↔ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)))
2317, 22anbi12d 643 . . . . . . . 8 (𝑟 = → ((𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
2423ralbidv 3188 . . . . . . 7 (𝑟 = → (∀𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
25242ralbidv 3229 . . . . . 6 (𝑟 = → (∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
2616, 25syl 18 . . . . 5 (𝑟 = (le‘𝐾) → (∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
2713, 26sylan9bb 518 . . . 4 ((𝑏 = (Base‘𝐾) ∧ 𝑟 = (le‘𝐾)) → (∀𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
285, 6, 27sbc2ie 3820 . . 3 ([(Base‘𝐾) / 𝑏][(le‘𝐾) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)))
294, 28bitrdi 290 . 2 (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
30 df-proset 18351 . 2 Proset = {𝑓[(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))}
3129, 30elab4g 3643 1 (𝐾 ∈ Proset ↔ (𝐾 ∈ V ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  Vcvv 3455  [wsbc 3745   class class class wbr 5110  cfv 6538  Basecbs 17270  lecple 17318   Proset cproset 18349
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-nul 5270
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-iota 6494  df-fv 6546  df-proset 18351
This theorem is referenced by:  prslem  18354  oduprs  18357  ispos2  18372  ressprs  33264  isprsd  49710
  Copyright terms: Public domain W3C validator