Proof of Theorem reclem1pr
| Step | Hyp | Ref
| Expression |
| 1 | | prpssnq 3888 |
. . . . . 6
⊢ (A
∈ P → A ⊂
Q) |
| 2 | | pssnel 1752 |
. . . . . 6
⊢ (A
⊂ Q → ∃x(x ∈
Q ∧ ¬ x ∈
A)) |
| 3 | | recclpq 3866 |
. . . . . . . . . . 11
⊢ (x
∈ Q → (*Q ‘x) ∈ Q) |
| 4 | | dmrecpq 3868 |
. . . . . . . . . . . 12
⊢ dom *Q =
Q |
| 5 | | 0npq 3844 |
. . . . . . . . . . . 12
⊢ ¬ ∅ ∈
Q |
| 6 | 4, 5 | ndmfvrcl 2849 |
. . . . . . . . . . 11
⊢ ((*Q
‘x) ∈ Q →
x ∈ Q) |
| 7 | 3, 6 | impbi 139 |
. . . . . . . . . 10
⊢ (x
∈ Q ↔ (*Q ‘x) ∈ Q) |
| 8 | 7 | anbi1i 368 |
. . . . . . . . 9
⊢ ((x
∈ Q ∧ ¬ (*Q
‘(*Q ‘x)) ∈ A)
↔ ((*Q ‘x) ∈ Q ∧ ¬
(*Q ‘(*Q
‘x)) ∈ A)) |
| 9 | | visset 1350 |
. . . . . . . . . . . . 13
⊢ x
∈ V |
| 10 | 9 | recrecpq 3867 |
. . . . . . . . . . . 12
⊢ (x
∈ Q → (*Q
‘(*Q ‘x)) = x) |
| 11 | 10 | eleq1d 1155 |
. . . . . . . . . . 11
⊢ (x
∈ Q → ((*Q
‘(*Q ‘x)) ∈ A
↔ x ∈ A)) |
| 12 | 11 | negbid 463 |
. . . . . . . . . 10
⊢ (x
∈ Q → (¬ (*Q
‘(*Q ‘x)) ∈ A
↔ ¬ x ∈ A)) |
| 13 | 12 | pm5.32i 489 |
. . . . . . . . 9
⊢ ((x
∈ Q ∧ ¬ (*Q
‘(*Q ‘x)) ∈ A)
↔ (x ∈ Q ∧
¬ x ∈ A)) |
| 14 | 8, 13 | bitr3 153 |
. . . . . . . 8
⊢ (((*Q
‘x) ∈ Q ∧
¬ (*Q ‘(*Q
‘x)) ∈ A) ↔ (x
∈ Q ∧ ¬ x ∈
A)) |
| 15 | | fvex 2838 |
. . . . . . . . 9
⊢ (*Q
‘x) ∈ V |
| 16 | | eleq1 1149 |
. . . . . . . . . 10
⊢ (y =
(*Q ‘x)
→ (y ∈ Q ↔
(*Q ‘x)
∈ Q)) |
| 17 | | fveq2 2832 |
. . . . . . . . . . . 12
⊢ (y =
(*Q ‘x)
→ (*Q ‘y) = (*Q
‘(*Q ‘x))) |
| 18 | 17 | eleq1d 1155 |
. . . . . . . . . . 11
⊢ (y =
(*Q ‘x)
→ ((*Q ‘y) ∈ A
↔ (*Q ‘(*Q
‘x)) ∈ A)) |
| 19 | 18 | negbid 463 |
. . . . . . . . . 10
⊢ (y =
(*Q ‘x)
→ (¬ (*Q ‘y) ∈ A
↔ ¬ (*Q ‘(*Q
‘x)) ∈ A)) |
| 20 | 16, 19 | anbi12d 476 |
. . . . . . . . 9
⊢ (y =
(*Q ‘x)
→ ((y ∈ Q ∧
¬ (*Q ‘y) ∈ A)
↔ ((*Q ‘x) ∈ Q ∧ ¬
(*Q ‘(*Q
‘x)) ∈ A))) |
| 21 | 15, 20 | cla4ev 1401 |
. . . . . . . 8
⊢ (((*Q
‘x) ∈ Q ∧
¬ (*Q ‘(*Q
‘x)) ∈ A) → ∃y(y ∈
Q ∧ ¬ (*Q ‘y) ∈ A)) |
| 22 | 14, 21 | sylbir 176 |
. . . . . . 7
⊢ ((x
∈ Q ∧ ¬ x ∈
A) → ∃y(y ∈
Q ∧ ¬ (*Q ‘y) ∈ A)) |
| 23 | 22 | 19.23aiv 952 |
. . . . . 6
⊢ (∃x(x ∈
Q ∧ ¬ x ∈
A) → ∃y(y ∈
Q ∧ ¬ (*Q ‘y) ∈ A)) |
| 24 | 1, 2, 23 | 3syl 21 |
. . . . 5
⊢ (A
∈ P → ∃y(y ∈
Q ∧ ¬ (*Q ‘y) ∈ A)) |
| 25 | | nsmallpq 3877 |
. . . . . . . 8
⊢ (y
∈ Q → ∃x
x <Q y) |
| 26 | 25 | anim1i 269 |
. . . . . . 7
⊢ ((y
∈ Q ∧ ¬ (*Q ‘y) ∈ A)
→ (∃x x <Q y ∧ ¬ (*Q
‘y) ∈ A)) |
| 27 | | 19.41v 963 |
. . . . . . 7
⊢ (∃x(x
<Q y ∧
¬ (*Q ‘y) ∈ A)
↔ (∃x x <Q y ∧ ¬ (*Q
‘y) ∈ A)) |
| 28 | 26, 27 | sylibr 175 |
. . . . . 6
⊢ ((y
∈ Q ∧ ¬ (*Q ‘y) ∈ A)
→ ∃x(x <Q y ∧ ¬ (*Q
‘y) ∈ A)) |
| 29 | 28 | 19.22i 723 |
. . . . 5
⊢ (∃y(y ∈
Q ∧ ¬ (*Q ‘y) ∈ A)
→ ∃y∃x(x
<Q y ∧
¬ (*Q ‘y) ∈ A)) |
| 30 | 24, 29 | syl 12 |
. . . 4
⊢ (A
∈ P → ∃y∃x(x
<Q y ∧
¬ (*Q ‘y) ∈ A)) |
| 31 | | excom 728 |
. . . 4
⊢ (∃x∃y(x
<Q y ∧
¬ (*Q ‘y) ∈ A)
↔ ∃y∃x(x
<Q y ∧
¬ (*Q ‘y) ∈ A)) |
| 32 | 30, 31 | sylibr 175 |
. . 3
⊢ (A
∈ P → ∃x∃y(x
<Q y ∧
¬ (*Q ‘y) ∈ A)) |
| 33 | | reclempr.1 |
. . . . 5
⊢ B =
{x∣∃y(x
<Q y ∧
¬ (*Q ‘y) ∈ A)} |
| 34 | 33 | cleqabi 1176 |
. . . 4
⊢ (x
∈ B ↔ ∃y(x
<Q y ∧
¬ (*Q ‘y) ∈ A)) |
| 35 | 34 | biex 733 |
. . 3
⊢ (∃x x ∈
B ↔ ∃x∃y(x
<Q y ∧
¬ (*Q ‘y) ∈ A)) |
| 36 | 32, 35 | sylibr 175 |
. 2
⊢ (A
∈ P → ∃x
x ∈ B) |
| 37 | | 0pss 1730 |
. . 3
⊢ (∅ ⊂ B ↔ ¬ B
= ∅) |
| 38 | | n0 1714 |
. . 3
⊢ (¬ B = ∅ ↔ ∃x x ∈
B) |
| 39 | 37, 38 | bitr 151 |
. 2
⊢ (∅ ⊂ B ↔ ∃x x ∈
B) |
| 40 | 36, 39 | sylibr 175 |
1
⊢ (A
∈ P → ∅ ⊂ B) |