Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isprsd Structured version   Visualization version   GIF version

Theorem isprsd 47541
Description: Property of being a preordered set (deduction form). (Contributed by Zhi Wang, 18-Sep-2024.)
Hypotheses
Ref Expression
isprsd.b (𝜑𝐵 = (Base‘𝐾))
isprsd.l (𝜑 = (le‘𝐾))
isprsd.k (𝜑𝐾𝑉)
Assertion
Ref Expression
isprsd (𝜑 → (𝐾 ∈ Proset ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
Distinct variable groups:   𝑥,𝐾,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐵(𝑥,𝑦,𝑧)   (𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem isprsd
StepHypRef Expression
1 isprsd.k . . . 4 (𝜑𝐾𝑉)
21elexd 3494 . . 3 (𝜑𝐾 ∈ V)
3 eqid 2732 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
4 eqid 2732 . . . . 5 (le‘𝐾) = (le‘𝐾)
53, 4isprs 18246 . . . 4 (𝐾 ∈ Proset ↔ (𝐾 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
65baib 536 . . 3 (𝐾 ∈ V → (𝐾 ∈ Proset ↔ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
72, 6syl 17 . 2 (𝜑 → (𝐾 ∈ Proset ↔ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
8 isprsd.b . . 3 (𝜑𝐵 = (Base‘𝐾))
9 isprsd.l . . . . . . 7 (𝜑 = (le‘𝐾))
109breqd 5158 . . . . . 6 (𝜑 → (𝑥 𝑥𝑥(le‘𝐾)𝑥))
119breqd 5158 . . . . . . . 8 (𝜑 → (𝑥 𝑦𝑥(le‘𝐾)𝑦))
129breqd 5158 . . . . . . . 8 (𝜑 → (𝑦 𝑧𝑦(le‘𝐾)𝑧))
1311, 12anbi12d 631 . . . . . . 7 (𝜑 → ((𝑥 𝑦𝑦 𝑧) ↔ (𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧)))
149breqd 5158 . . . . . . 7 (𝜑 → (𝑥 𝑧𝑥(le‘𝐾)𝑧))
1513, 14imbi12d 344 . . . . . 6 (𝜑 → (((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧) ↔ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧)))
1610, 15anbi12d 631 . . . . 5 (𝜑 → ((𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)) ↔ (𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
178, 16raleqbidv 3342 . . . 4 (𝜑 → (∀𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)) ↔ ∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
188, 17raleqbidv 3342 . . 3 (𝜑 → (∀𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)) ↔ ∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
198, 18raleqbidv 3342 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧)) ↔ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
207, 19bitr4d 281 1 (𝜑 → (𝐾 ∈ Proset ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 (𝑥 𝑥 ∧ ((𝑥 𝑦𝑦 𝑧) → 𝑥 𝑧))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3061  Vcvv 3474   class class class wbr 5147  cfv 6540  Basecbs 17140  lecple 17200   Proset cproset 18242
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-nul 5305
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-iota 6492  df-fv 6548  df-proset 18244
This theorem is referenced by:  catprs2  47585  prstcprs  47648
  Copyright terms: Public domain W3C validator