Proof of Theorem ltmpi
| Step | Hyp | Ref
| Expression |
| 1 | | ltmpi.2 |
. 2
⊢ B
∈ V |
| 2 | | dmmulpi 3813 |
. 2
⊢ dom ·N =
(N × N) |
| 3 | | ltmpi.1 |
. 2
⊢ A
∈ V |
| 4 | | ltrelpi 3811 |
. 2
⊢ <N ⊆
(N × N) |
| 5 | | 0npi 3804 |
. 2
⊢ ¬ ∅ ∈
N |
| 6 | | iba 486 |
. . . . . . . . . . 11
⊢ (∅ ∈ C → (A
∈ B ↔ (A ∈ B ∧
∅ ∈ C))) |
| 7 | | nnmord 3189 |
. . . . . . . . . . 11
⊢ ((A
∈ ω ∧ B ∈ ω ∧
C ∈ ω) → ((A ∈ B ∧
∅ ∈ C) ↔ (C ·o A) ∈ (C
·o B))) |
| 8 | 6, 7 | sylan9bbr 419 |
. . . . . . . . . 10
⊢ (((A
∈ ω ∧ B ∈ ω ∧
C ∈ ω) ∧ ∅ ∈
C) → (A ∈ B
↔ (C ·o
A) ∈ (C ·o B))) |
| 9 | 8 | exp 291 |
. . . . . . . . 9
⊢ ((A
∈ ω ∧ B ∈ ω ∧
C ∈ ω) → (∅ ∈
C → (A ∈ B
↔ (C ·o
A) ∈ (C ·o B)))) |
| 10 | 9 | 3exp 611 |
. . . . . . . 8
⊢ (A
∈ ω → (B ∈ ω
→ (C ∈ ω → (∅
∈ C → (A ∈ B
↔ (C ·o
A) ∈ (C ·o B)))))) |
| 11 | 10 | imp4b 283 |
. . . . . . 7
⊢ ((A
∈ ω ∧ B ∈ ω)
→ ((C ∈ ω ∧ ∅
∈ C) → (A ∈ B
↔ (C ·o
A) ∈ (C ·o B)))) |
| 12 | | elni2 3799 |
. . . . . . 7
⊢ (C
∈ N ↔ (C ∈
ω ∧ ∅ ∈ C)) |
| 13 | 11, 12 | syl5ib 181 |
. . . . . 6
⊢ ((A
∈ ω ∧ B ∈ ω)
→ (C ∈ N →
(A ∈ B ↔ (C
·o A) ∈
(C ·o B)))) |
| 14 | | pinn 3800 |
. . . . . 6
⊢ (A
∈ N → A ∈
ω) |
| 15 | | pinn 3800 |
. . . . . 6
⊢ (B
∈ N → B ∈
ω) |
| 16 | 13, 14, 15 | syl2an 349 |
. . . . 5
⊢ ((A
∈ N ∧ B ∈
N) → (C ∈
N → (A ∈ B ↔ (C
·o A) ∈
(C ·o B)))) |
| 17 | 16 | imp 277 |
. . . 4
⊢ (((A
∈ N ∧ B ∈
N) ∧ C ∈
N) → (A ∈ B ↔ (C
·o A) ∈
(C ·o B))) |
| 18 | | ltpiord 3809 |
. . . . 5
⊢ ((A
∈ N ∧ B ∈
N) → (A
<N B ↔
A ∈ B)) |
| 19 | 18 | adantr 306 |
. . . 4
⊢ (((A
∈ N ∧ B ∈
N) ∧ C ∈
N) → (A
<N B ↔
A ∈ B)) |
| 20 | | ltpiord 3809 |
. . . . . . . 8
⊢ (((C
·N A)
∈ N ∧ (C
·N B)
∈ N) → ((C
·N A)
<N (C
·N B)
↔ (C
·N A)
∈ (C
·N B))) |
| 21 | | mulclpi 3815 |
. . . . . . . 8
⊢ ((C
∈ N ∧ A ∈
N) → (C
·N A)
∈ N) |
| 22 | | mulclpi 3815 |
. . . . . . . 8
⊢ ((C
∈ N ∧ B ∈
N) → (C
·N B)
∈ N) |
| 23 | 20, 21, 22 | syl2an 349 |
. . . . . . 7
⊢ (((C
∈ N ∧ A ∈
N) ∧ (C ∈
N ∧ B ∈
N)) → ((C
·N A)
<N (C
·N B)
↔ (C
·N A)
∈ (C
·N B))) |
| 24 | | mulpiord 3807 |
. . . . . . . . 9
⊢ ((C
∈ N ∧ A ∈
N) → (C
·N A) =
(C ·o A)) |
| 25 | 24 | adantr 306 |
. . . . . . . 8
⊢ (((C
∈ N ∧ A ∈
N) ∧ (C ∈
N ∧ B ∈
N)) → (C
·N A) =
(C ·o A)) |
| 26 | | mulpiord 3807 |
. . . . . . . . 9
⊢ ((C
∈ N ∧ B ∈
N) → (C
·N B) =
(C ·o B)) |
| 27 | 26 | adantl 305 |
. . . . . . . 8
⊢ (((C
∈ N ∧ A ∈
N) ∧ (C ∈
N ∧ B ∈
N)) → (C
·N B) =
(C ·o B)) |
| 28 | 25, 27 | eleq12d 1157 |
. . . . . . 7
⊢ (((C
∈ N ∧ A ∈
N) ∧ (C ∈
N ∧ B ∈
N)) → ((C
·N A)
∈ (C
·N B)
↔ (C ·o
A) ∈ (C ·o B))) |
| 29 | 23, 28 | bitrd 406 |
. . . . . 6
⊢ (((C
∈ N ∧ A ∈
N) ∧ (C ∈
N ∧ B ∈
N)) → ((C
·N A)
<N (C
·N B)
↔ (C ·o
A) ∈ (C ·o B))) |
| 30 | 29 | anandis 394 |
. . . . 5
⊢ ((C
∈ N ∧ (A ∈
N ∧ B ∈
N)) → ((C
·N A)
<N (C
·N B)
↔ (C ·o
A) ∈ (C ·o B))) |
| 31 | 30 | ancoms 334 |
. . . 4
⊢ (((A
∈ N ∧ B ∈
N) ∧ C ∈
N) → ((C
·N A)
<N (C
·N B)
↔ (C ·o
A) ∈ (C ·o B))) |
| 32 | 17, 19, 31 | 3bitr4d 424 |
. . 3
⊢ (((A
∈ N ∧ B ∈
N) ∧ C ∈
N) → (A
<N B ↔
(C ·N
A) <N (C ·N B))) |
| 33 | 32 | 3impa 609 |
. 2
⊢ ((A
∈ N ∧ B ∈
N ∧ C ∈
N) → (A
<N B ↔
(C ·N
A) <N (C ·N B))) |
| 34 | 1, 2, 3, 4, 5, 33 | ndmord 3064 |
1
⊢ (C
∈ N → (A
<N B ↔
(C ·N
A) <N (C ·N B))) |