Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > Mathboxes > strcollnfALT | GIF version |
Description: Alternate proof of strcollnf 10110, not using strcollnft 10109. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
strcollnf.nf | ⊢ Ⅎ𝑏𝜑 |
Ref | Expression |
---|---|
strcollnfALT | ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑏∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | strcoll2 10108 | . 2 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑧∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑)) | |
2 | nfv 1421 | . . . . 5 ⊢ Ⅎ𝑏 𝑦 ∈ 𝑧 | |
3 | nfcv 2178 | . . . . . 6 ⊢ Ⅎ𝑏𝑎 | |
4 | strcollnf.nf | . . . . . 6 ⊢ Ⅎ𝑏𝜑 | |
5 | 3, 4 | nfrexxy 2361 | . . . . 5 ⊢ Ⅎ𝑏∃𝑥 ∈ 𝑎 𝜑 |
6 | 2, 5 | nfbi 1481 | . . . 4 ⊢ Ⅎ𝑏(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) |
7 | 6 | nfal 1468 | . . 3 ⊢ Ⅎ𝑏∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) |
8 | nfv 1421 | . . 3 ⊢ Ⅎ𝑧∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑) | |
9 | elequ2 1601 | . . . . 5 ⊢ (𝑧 = 𝑏 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑏)) | |
10 | 9 | bibi1d 222 | . . . 4 ⊢ (𝑧 = 𝑏 → ((𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) ↔ (𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑))) |
11 | 10 | albidv 1705 | . . 3 ⊢ (𝑧 = 𝑏 → (∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑))) |
12 | 7, 8, 11 | cbvex 1639 | . 2 ⊢ (∃𝑧∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) ↔ ∃𝑏∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑)) |
13 | 1, 12 | sylib 127 | 1 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑏∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 98 ∀wal 1241 Ⅎwnf 1349 ∃wex 1381 ∀wral 2306 ∃wrex 2307 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-strcoll 10107 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |