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

Theorem isprs 18367
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 6920 . . . 4 (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾))
2 fveq2 6920 . . . . 5 (𝑓 = 𝐾 → (le‘𝑓) = (le‘𝐾))
32sbceq1d 3809 . . . 4 (𝑓 = 𝐾 → ([(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ [(le‘𝐾) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
41, 3sbceqbid 3811 . . 3 (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ [(Base‘𝐾) / 𝑏][(le‘𝐾) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
5 fvex 6933 . . . 4 (Base‘𝐾) ∈ V
6 fvex 6933 . . . 4 (le‘𝐾) ∈ V
7 isprs.b . . . . . . 7 𝐵 = (Base‘𝐾)
8 eqtr3 2766 . . . . . . 7 ((𝑏 = (Base‘𝐾) ∧ 𝐵 = (Base‘𝐾)) → 𝑏 = 𝐵)
97, 8mpan2 690 . . . . . 6 (𝑏 = (Base‘𝐾) → 𝑏 = 𝐵)
10 raleq 3331 . . . . . . . 8 (𝑏 = 𝐵 → (∀𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
1110raleqbi1dv 3346 . . . . . . 7 (𝑏 = 𝐵 → (∀𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
1211raleqbi1dv 3346 . . . . . 6 (𝑏 = 𝐵 → (∀𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
139, 12syl 17 . . . . 5 (𝑏 = (Base‘𝐾) → (∀𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))))
14 isprs.l . . . . . . 7 = (le‘𝐾)
15 eqtr3 2766 . . . . . . 7 ((𝑟 = (le‘𝐾) ∧ = (le‘𝐾)) → 𝑟 = )
1614, 15mpan2 690 . . . . . 6 (𝑟 = (le‘𝐾) → 𝑟 = )
17 breq 5168 . . . . . . . . 9 (𝑟 = → (𝑥𝑟𝑥𝑥 𝑥))
18 breq 5168 . . . . . . . . . . 11 (𝑟 = → (𝑥𝑟𝑦𝑥 𝑦))
19 breq 5168 . . . . . . . . . . 11 (𝑟 = → (𝑦𝑟𝑧𝑦 𝑧))
2018, 19anbi12d 631 . . . . . . . . . 10 (𝑟 = → ((𝑥𝑟𝑦𝑦𝑟𝑧) ↔ (𝑥 𝑦𝑦 𝑧)))
21 breq 5168 . . . . . . . . . 10 (𝑟 = → (𝑥𝑟𝑧𝑥 𝑧))
2220, 21imbi12d 344 . . . . . . . . 9 (𝑟 = → (((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧) ↔ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)))
2317, 22anbi12d 631 . . . . . . . 8 (𝑟 = → ((𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
2423ralbidv 3184 . . . . . . 7 (𝑟 = → (∀𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
25242ralbidv 3227 . . . . . 6 (𝑟 = → (∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
2616, 25syl 17 . . . . 5 (𝑟 = (le‘𝐾) → (∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
2713, 26sylan9bb 509 . . . 4 ((𝑏 = (Base‘𝐾) ∧ 𝑟 = (le‘𝐾)) → (∀𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
285, 6, 27sbc2ie 3887 . . 3 ([(Base‘𝐾) / 𝑏][(le‘𝐾) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)))
294, 28bitrdi 287 . 2 (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧)) ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
30 df-proset 18365 . 2 Proset = {𝑓[(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟]𝑥𝑏𝑦𝑏𝑧𝑏 (𝑥𝑟𝑥 ∧ ((𝑥𝑟𝑦𝑦𝑟𝑧) → 𝑥𝑟𝑧))}
3129, 30elab4g 3699 1 (𝐾 ∈ Proset ↔ (𝐾 ∈ V ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wral 3067  Vcvv 3488  [wsbc 3804   class class class wbr 5166  cfv 6573  Basecbs 17258  lecple 17318   Proset cproset 18363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-nul 5324
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581  df-proset 18365
This theorem is referenced by:  prslem  18368  ispos2  18385  ressprs  32936  oduprs  32937  isprsd  48635
  Copyright terms: Public domain W3C validator