Proof of Theorem omlsi
| Step | Hyp | Ref
| Expression |
| 1 | | omlsi.3 |
. 2
⊢ A ⊆ B |
| 2 | | omlsi.2 |
. . . . . 6
⊢ B ∈ Sℋ |
| 3 | 2 | shel 9089 |
. . . . 5
⊢ (x ∈ B → x ∈ ℋ ) |
| 4 | | omlsi.1 |
. . . . . 6
⊢ A ∈ Cℋ |
| 5 | | pjtht 9241 |
. . . . . 6
⊢ ((A ∈ Cℋ ⋀ x ∈ ℋ ) →
∃y ∈ A ∃z ∈ (⊥
‘A)x = (y
+h z)) |
| 6 | 4, 5 | mpan 699 |
. . . . 5
⊢ (x ∈ ℋ → ∃y ∈ A ∃z ∈ (⊥
‘A)x = (y
+h z)) |
| 7 | 3, 6 | syl 10 |
. . . 4
⊢ (x ∈ B → ∃y ∈ A ∃z ∈ (⊥
‘A)x = (y
+h z)) |
| 8 | | eqeq1 1488 |
. . . . . . . . 9
⊢ (x = if(x ∈ B, x, 0h) → (x = (y
+h z) ↔ if(x ∈ B, x,
0h) = (y
+h z))) |
| 9 | | eleq1 1541 |
. . . . . . . . 9
⊢ (x = if(x ∈ B, x, 0h) → (x ∈ A ↔ if(x
∈ B,
x, 0h) ∈ A)) |
| 10 | 8, 9 | imbi12d 629 |
. . . . . . . 8
⊢ (x = if(x ∈ B, x, 0h) → ((x = (y
+h z) → x ∈ A) ↔ ( if(x
∈ B,
x, 0h) = (y +h z) → if(x
∈ B,
x, 0h) ∈ A))) |
| 11 | | opreq1 3982 |
. . . . . . . . . 10
⊢ (y = if(y ∈ A, y, 0h) → (y +h z) = ( if(y
∈ A,
y, 0h)
+h z)) |
| 12 | 11 | eqeq2d 1493 |
. . . . . . . . 9
⊢ (y = if(y ∈ A, y, 0h) → ( if(x ∈ B, x,
0h) = (y
+h z) ↔ if(x ∈ B, x,
0h) = ( if(y ∈ A, y, 0h) +h
z))) |
| 13 | 12 | imbi1d 616 |
. . . . . . . 8
⊢ (y = if(y ∈ A, y, 0h) → (( if(x ∈ B, x,
0h) = (y
+h z) → if(x ∈ B, x,
0h) ∈ A) ↔ ( if(x
∈ B,
x, 0h) = ( if(y ∈ A, y,
0h) +h z) → if(x
∈ B,
x, 0h) ∈ A))) |
| 14 | | opreq2 3983 |
. . . . . . . . . 10
⊢ (z = if(z ∈ (⊥
‘A), z, 0h) → ( if(y ∈ A, y,
0h) +h z) = ( if(y
∈ A,
y, 0h)
+h if(z ∈ (⊥
‘A), z, 0h))) |
| 15 | 14 | eqeq2d 1493 |
. . . . . . . . 9
⊢ (z = if(z ∈ (⊥
‘A), z, 0h) → ( if(x ∈ B, x,
0h) = ( if(y ∈ A, y, 0h) +h
z) ↔ if(x ∈ B, x,
0h) = ( if(y ∈ A, y, 0h) +h
if(z ∈
(⊥ ‘A), z,
0h)))) |
| 16 | 15 | imbi1d 616 |
. . . . . . . 8
⊢ (z = if(z ∈ (⊥
‘A), z, 0h) → (( if(x ∈ B, x,
0h) = ( if(y ∈ A, y, 0h) +h
z) → if(x ∈ B, x,
0h) ∈ A) ↔ ( if(x
∈ B,
x, 0h) = ( if(y ∈ A, y,
0h) +h if(z ∈ (⊥ ‘A),
z, 0h)) →
if(x ∈
B, x,
0h) ∈ A))) |
| 17 | 4 | chshi 9104 |
. . . . . . . . 9
⊢ A ∈ Sℋ |
| 18 | | omlsi.4 |
. . . . . . . . 9
⊢ (B ∩ (⊥
‘A)) = 0ℋ |
| 19 | | sh0 9091 |
. . . . . . . . . . 11
⊢ (B ∈ Sℋ → 0h
∈ B) |
| 20 | 2, 19 | ax-mp 7 |
. . . . . . . . . 10
⊢ 0h ∈ B |
| 21 | 20 | elimel 2404 |
. . . . . . . . 9
⊢ if(x ∈ B, x,
0h) ∈ B |
| 22 | | ch0 9105 |
. . . . . . . . . . 11
⊢ (A ∈ Cℋ → 0h
∈ A) |
| 23 | 4, 22 | ax-mp 7 |
. . . . . . . . . 10
⊢ 0h ∈ A |
| 24 | 23 | elimel 2404 |
. . . . . . . . 9
⊢ if(y ∈ A, y,
0h) ∈ A |
| 25 | | shocsh 9164 |
. . . . . . . . . . . 12
⊢ (A ∈ Sℋ → (⊥ ‘A)
∈ Sℋ ) |
| 26 | 17, 25 | ax-mp 7 |
. . . . . . . . . . 11
⊢ (⊥ ‘A)
∈ Sℋ |
| 27 | | sh0 9091 |
. . . . . . . . . . 11
⊢ ((⊥ ‘A)
∈ Sℋ → 0h
∈ (⊥
‘A)) |
| 28 | 26, 27 | ax-mp 7 |
. . . . . . . . . 10
⊢ 0h ∈ (⊥
‘A) |
| 29 | 28 | elimel 2404 |
. . . . . . . . 9
⊢ if(z ∈ (⊥ ‘A),
z, 0h) ∈ (⊥
‘A) |
| 30 | 17, 2, 1, 18, 21, 24, 29 | omlsilem 9251 |
. . . . . . . 8
⊢ ( if(x ∈ B, x,
0h) = ( if(y ∈ A, y, 0h) +h
if(z ∈
(⊥ ‘A), z,
0h)) → if(x ∈ B, x, 0h) ∈ A) |
| 31 | 10, 13, 16, 30 | dedth3h 2398 |
. . . . . . 7
⊢ ((x ∈ B ⋀ y ∈ A ⋀ z ∈ (⊥ ‘A))
→ (x = (y +h z) → x
∈ A)) |
| 32 | 31 | 3expia 839 |
. . . . . 6
⊢ ((x ∈ B ⋀ y ∈ A) → (z
∈ (⊥
‘A) → (x = (y
+h z) → x ∈ A))) |
| 33 | 32 | r19.23adv 1753 |
. . . . 5
⊢ ((x ∈ B ⋀ y ∈ A) → (∃z ∈ (⊥
‘A)x = (y
+h z) → x ∈ A)) |
| 34 | 33 | r19.23adva 1754 |
. . . 4
⊢ (x ∈ B → (∃y ∈ A ∃z ∈ (⊥
‘A)x = (y
+h z) → x ∈ A)) |
| 35 | 7, 34 | mpd 26 |
. . 3
⊢ (x ∈ B → x ∈ A) |
| 36 | 35 | ssriv 2078 |
. 2
⊢ B ⊆ A |
| 37 | 1, 36 | eqssi 2087 |
1
⊢ A = B |