Metamath Proof Explorer


Theorem isprsd

Description: Property of being a preordered set (deduction form). (Contributed by Zhi Wang, 18-Sep-2024)

Ref Expression
Hypotheses isprsd.b ⊢ φ → B = Base K
isprsd.l ⊢ φ → ≤ ˙ = ≤ K
isprsd.k ⊢ φ → K ∈ V
Assertion isprsd ⊢ φ → K ∈ Proset ↔ ∀ x ∈ B ∀ y ∈ B ∀ z ∈ B x ≤ ˙ x ∧ x ≤ ˙ y ∧ y ≤ ˙ z → x ≤ ˙ z

Proof

Step Hyp Ref Expression
1 isprsd.b ⊢ φ → B = Base K
2 isprsd.l ⊢ φ → ≤ ˙ = ≤ K
3 isprsd.k ⊢ φ → K ∈ V
4 3 elexd ⊢ φ → K ∈ V
5 eqid ⊢ Base K = Base K
6 eqid ⊢ ≤ K = ≤ K
7 5 6 isprs ⊢ K ∈ Proset ↔ K ∈ V ∧ ∀ x ∈ Base K ∀ y ∈ Base K ∀ z ∈ Base K x ≤ K x ∧ x ≤ K y ∧ y ≤ K z → x ≤ K z
8 7 baib ⊢ K ∈ V → K ∈ Proset ↔ ∀ x ∈ Base K ∀ y ∈ Base K ∀ z ∈ Base K x ≤ K x ∧ x ≤ K y ∧ y ≤ K z → x ≤ K z
9 4 8 syl ⊢ φ → K ∈ Proset ↔ ∀ x ∈ Base K ∀ y ∈ Base K ∀ z ∈ Base K x ≤ K x ∧ x ≤ K y ∧ y ≤ K z → x ≤ K z
10 2 breqd ⊢ φ → x ≤ ˙ x ↔ x ≤ K x
11 2 breqd ⊢ φ → x ≤ ˙ y ↔ x ≤ K y
12 2 breqd ⊢ φ → y ≤ ˙ z ↔ y ≤ K z
13 11 12 anbi12d ⊢ φ → x ≤ ˙ y ∧ y ≤ ˙ z ↔ x ≤ K y ∧ y ≤ K z
14 2 breqd ⊢ φ → x ≤ ˙ z ↔ x ≤ K z
15 13 14 imbi12d ⊢ φ → x ≤ ˙ y ∧ y ≤ ˙ z → x ≤ ˙ z ↔ x ≤ K y ∧ y ≤ K z → x ≤ K z
16 10 15 anbi12d ⊢ φ → x ≤ ˙ x ∧ x ≤ ˙ y ∧ y ≤ ˙ z → x ≤ ˙ z ↔ x ≤ K x ∧ x ≤ K y ∧ y ≤ K z → x ≤ K z
17 1 16 raleqbidv ⊢ φ → ∀ z ∈ B x ≤ ˙ x ∧ x ≤ ˙ y ∧ y ≤ ˙ z → x ≤ ˙ z ↔ ∀ z ∈ Base K x ≤ K x ∧ x ≤ K y ∧ y ≤ K z → x ≤ K z
18 1 17 raleqbidv ⊢ φ → ∀ y ∈ B ∀ z ∈ B x ≤ ˙ x ∧ x ≤ ˙ y ∧ y ≤ ˙ z → x ≤ ˙ z ↔ ∀ y ∈ Base K ∀ z ∈ Base K x ≤ K x ∧ x ≤ K y ∧ y ≤ K z → x ≤ K z
19 1 18 raleqbidv ⊢ φ → ∀ x ∈ B ∀ y ∈ B ∀ z ∈ B x ≤ ˙ x ∧ x ≤ ˙ y ∧ y ≤ ˙ z → x ≤ ˙ z ↔ ∀ x ∈ Base K ∀ y ∈ Base K ∀ z ∈ Base K x ≤ K x ∧ x ≤ K y ∧ y ≤ K z → x ≤ K z
20 9 19 bitr4d ⊢ φ → K ∈ Proset ↔ ∀ x ∈ B ∀ y ∈ B ∀ z ∈ B x ≤ ˙ x ∧ x ≤ ˙ y ∧ y ≤ ˙ z → x ≤ ˙ z