Proof of Theorem ordtr2
| Step | Hyp | Ref
| Expression |
| 1 | | ordsseleq 2227 |
. . . . . . . . . 10
⊢ ((Ord A ∧ Ord B)
→ (A ⊆ B ↔ (A
∈ B ∨ A = B))) |
| 2 | 1 | biimpd 135 |
. . . . . . . . 9
⊢ ((Ord A ∧ Ord B)
→ (A ⊆ B → (A
∈ B ∨ A = B))) |
| 3 | | ordtr1 2256 |
. . . . . . . . . . . . 13
⊢ (Ord C
→ ((A ∈ B ∧ B ∈
C) → A ∈ C)) |
| 4 | 3 | exp3a 292 |
. . . . . . . . . . . 12
⊢ (Ord C
→ (A ∈ B → (B
∈ C → A ∈ C))) |
| 5 | | eleq1a 1158 |
. . . . . . . . . . . . . 14
⊢ (B
∈ C → (A = B →
A ∈ C)) |
| 6 | 5 | com12 13 |
. . . . . . . . . . . . 13
⊢ (A =
B → (B ∈ C
→ A ∈ C)) |
| 7 | 6 | a1i 7 |
. . . . . . . . . . . 12
⊢ (Ord C
→ (A = B → (B
∈ C → A ∈ C))) |
| 8 | 4, 7 | jaod 329 |
. . . . . . . . . . 11
⊢ (Ord C
→ ((A ∈ B ∨ A =
B) → (B ∈ C
→ A ∈ C))) |
| 9 | 8 | com23 32 |
. . . . . . . . . 10
⊢ (Ord C
→ (B ∈ C → ((A
∈ B ∨ A = B) →
A ∈ C))) |
| 10 | 9 | imp 277 |
. . . . . . . . 9
⊢ ((Ord C ∧ B ∈
C) → ((A ∈ B ∨
A = B)
→ A ∈ C)) |
| 11 | 2, 10 | syl9 55 |
. . . . . . . 8
⊢ ((Ord A ∧ Ord B)
→ ((Ord C ∧ B ∈ C)
→ (A ⊆ B → A
∈ C))) |
| 12 | 11 | exp 291 |
. . . . . . 7
⊢ (Ord A
→ (Ord B → ((Ord C ∧ B ∈
C) → (A ⊆ B
→ A ∈ C)))) |
| 13 | | ordelord 2221 |
. . . . . . 7
⊢ ((Ord C ∧ B ∈
C) → Ord B) |
| 14 | 12, 13 | syl5 22 |
. . . . . 6
⊢ (Ord A
→ ((Ord C ∧ B ∈ C)
→ ((Ord C ∧ B ∈ C)
→ (A ⊆ B → A
∈ C)))) |
| 15 | 14 | pm2.43d 59 |
. . . . 5
⊢ (Ord A
→ ((Ord C ∧ B ∈ C)
→ (A ⊆ B → A
∈ C))) |
| 16 | 15 | exp3a 292 |
. . . 4
⊢ (Ord A
→ (Ord C → (B ∈ C
→ (A ⊆ B → A
∈ C)))) |
| 17 | 16 | imp 277 |
. . 3
⊢ ((Ord A ∧ Ord C)
→ (B ∈ C → (A
⊆ B → A ∈ C))) |
| 18 | 17 | com23 32 |
. 2
⊢ ((Ord A ∧ Ord C)
→ (A ⊆ B → (B
∈ C → A ∈ C))) |
| 19 | 18 | imp3a 279 |
1
⊢ ((Ord A ∧ Ord C)
→ ((A ⊆ B ∧ B ∈
C) → A ∈ C)) |