ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  df-wetr GIF version

Definition df-wetr 4481
Description: Define the well-ordering predicate. It is unusual to define "well-ordering" in the absence of excluded middle, but we mean an ordering which is like the ordering which we have for ordinals (for example, it does not entail trichotomy because ordinals do not have that as seen at ordtriexmid 4670). Given excluded middle, well-ordering is usually defined to require trichotomy (and the definition of Fr is typically also different). (Contributed by Mario Carneiro and Jim Kingdon, 23-Sep-2021.)
Assertion
Ref Expression
df-wetr (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧

Detailed syntax breakdown of Definition df-wetr
StepHypRef Expression
1 cA . . 3 class 𝐴
2 cR . . 3 class 𝑅
31, 2wwe 4477 . 2 wff 𝑅 We 𝐴
41, 2wfr 4475 . . 3 wff 𝑅 Fr 𝐴
5 vx . . . . . . . . . 10 setvar 𝑥
65cv 1401 . . . . . . . . 9 class 𝑥
7 vy . . . . . . . . . 10 setvar 𝑦
87cv 1401 . . . . . . . . 9 class 𝑦
96, 8, 2wbr 4131 . . . . . . . 8 wff 𝑥𝑅𝑦
10 vz . . . . . . . . . 10 setvar 𝑧
1110cv 1401 . . . . . . . . 9 class 𝑧
128, 11, 2wbr 4131 . . . . . . . 8 wff 𝑦𝑅𝑧
139, 12wa 104 . . . . . . 7 wff (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)
146, 11, 2wbr 4131 . . . . . . 7 wff 𝑥𝑅𝑧
1513, 14wi 4 . . . . . 6 wff ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)
1615, 10, 1wral 2528 . . . . 5 wff ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)
1716, 7, 1wral 2528 . . . 4 wff ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)
1817, 5, 1wral 2528 . . 3 wff ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)
194, 18wa 104 . 2 wff (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
203, 19wb 105 1 wff (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
Colors of variables:    wff set class
This definition is used by:  nfwe  4502  weeq1  4503  weeq2  4504  wefr  4505  wepo  4506  wetrep  4507  we0  4508  ordwe  4725  wessep  4727  reg3exmidlemwe  4728
  Copyright terms: Public domain W3C validator