Theorem isprsd 47636

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

Step	Hyp	Ref	Expression
1		isprsd.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
2	1	elexd 3495	. . 3 ⊢ (𝜑 → 𝐾 ∈ V)
3		eqid 2733	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
4		eqid 2733	. . . . 5 ⊢ (le‘𝐾) = (le‘𝐾)
5	3, 4	isprs 18250	. . . 4 ⊢ (𝐾 ∈ Proset ↔ (𝐾 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
6	5	baib 537	. . 3 ⊢ (𝐾 ∈ V → (𝐾 ∈ Proset ↔ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
7	2, 6	syl 17	. 2 ⊢ (𝜑 → (𝐾 ∈ Proset ↔ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
8		isprsd.b	. . 3 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
9		isprsd.l	. . . . . . 7 ⊢ (𝜑 → ≤ = (le‘𝐾))
10	9	breqd 5160	. . . . . 6 ⊢ (𝜑 → (𝑥 ≤ 𝑥 ↔ 𝑥(le‘𝐾)𝑥))
11	9	breqd 5160	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ≤ 𝑦 ↔ 𝑥(le‘𝐾)𝑦))
12	9	breqd 5160	. . . . . . . 8 ⊢ (𝜑 → (𝑦 ≤ 𝑧 ↔ 𝑦(le‘𝐾)𝑧))
13	11, 12	anbi12d 632	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) ↔ (𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧)))
14	9	breqd 5160	. . . . . . 7 ⊢ (𝜑 → (𝑥 ≤ 𝑧 ↔ 𝑥(le‘𝐾)𝑧))
15	13, 14	imbi12d 345	. . . . . 6 ⊢ (𝜑 → (((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧) ↔ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧)))
16	10, 15	anbi12d 632	. . . . 5 ⊢ (𝜑 → ((𝑥 ≤ 𝑥 ∧ ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧)) ↔ (𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
17	8, 16	raleqbidv 3343	. . . 4 ⊢ (𝜑 → (∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑥 ∧ ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧)) ↔ ∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
18	8, 17	raleqbidv 3343	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑥 ∧ ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧)) ↔ ∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
19	8, 18	raleqbidv 3343	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑥 ∧ ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧)) ↔ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑥 ∧ ((𝑥(le‘𝐾)𝑦 ∧ 𝑦(le‘𝐾)𝑧) → 𝑥(le‘𝐾)𝑧))))
20	7, 19	bitr4d 282	1 ⊢ (𝜑 → (𝐾 ∈ Proset ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝑥 ≤ 𝑥 ∧ ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542   ∈ wcel 2107  ∀wral 3062  Vcvv 3475   class class class wbr 5149  ‘cfv 6544  Basecbs 17144  lecple 17204   Proset cproset 18246

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-nul 5307

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-sbc 3779  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-iota 6496  df-fv 6552  df-proset 18248

This theorem is referenced by:  catprs2  47680  prstcprs  47743