Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > df-iord | GIF version |
Description: Define the ordinal
predicate, which is true for a class that is
transitive and whose elements are transitive. Definition of ordinal in
[Crosilla], p. "Set-theoretic
principles incompatible with
intuitionistic logic".
Some sources will define a notation for ordinal order corresponding to < and ≤ but we just use ∈ and ⊆ respectively. (Contributed by Jim Kingdon, 10-Oct-2018.) Use its alias dford3 4344 instead for naming consistency with set.mm. (New usage is discouraged.) |
Ref | Expression |
---|---|
df-iord | ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cA | . . 3 class 𝐴 | |
2 | 1 | word 4339 | . 2 wff Ord 𝐴 |
3 | 1 | wtr 4079 | . . 3 wff Tr 𝐴 |
4 | vx | . . . . . 6 setvar 𝑥 | |
5 | 4 | cv 1342 | . . . . 5 class 𝑥 |
6 | 5 | wtr 4079 | . . . 4 wff Tr 𝑥 |
7 | 6, 4, 1 | wral 2443 | . . 3 wff ∀𝑥 ∈ 𝐴 Tr 𝑥 |
8 | 3, 7 | wa 103 | . 2 wff (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥) |
9 | 2, 8 | wb 104 | 1 wff (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥)) |
Colors of variables: wff set class |
This definition is referenced by: dford3 4344 |
Copyright terms: Public domain | W3C validator |