Theorem strcollnft 13518

Description: Closed form of strcollnf 13519. (Contributed by BJ, 21-Oct-2019.)

Assertion

Ref	Expression
strcollnft	⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑏(∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑏 𝜑 ∧ ∀𝑦 ∈ 𝑏 ∃𝑥 ∈ 𝑎 𝜑)))

Distinct variable group:   𝑎,𝑏,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem strcollnft

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		strcoll2 13517	. 2 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑧(∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑧 𝜑 ∧ ∀𝑦 ∈ 𝑧 ∃𝑥 ∈ 𝑎 𝜑))
2		nfnf1 1524	. . . . 5 ⊢ Ⅎ𝑏Ⅎ𝑏𝜑
3	2	nfal 1556	. . . 4 ⊢ Ⅎ𝑏∀𝑦Ⅎ𝑏𝜑
4	3	nfal 1556	. . 3 ⊢ Ⅎ𝑏∀𝑥∀𝑦Ⅎ𝑏𝜑
5		nfa1 1521	. . . . 5 ⊢ Ⅎ𝑥∀𝑥∀𝑦Ⅎ𝑏𝜑
6		nfcvd 2300	. . . . 5 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏𝑎)
7		nfa1 1521	. . . . . . 7 ⊢ Ⅎ𝑦∀𝑦Ⅎ𝑏𝜑
8	7	nfal 1556	. . . . . 6 ⊢ Ⅎ𝑦∀𝑥∀𝑦Ⅎ𝑏𝜑
9		nfcvd 2300	. . . . . 6 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏𝑧)
10		sp 1491	. . . . . . 7 ⊢ (∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏𝜑)
11	10	sps 1517	. . . . . 6 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏𝜑)
12	8, 9, 11	nfrexdxy 2491	. . . . 5 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏∃𝑦 ∈ 𝑧 𝜑)
13	5, 6, 12	nfraldxy 2490	. . . 4 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑧 𝜑)
14	5, 6, 11	nfrexdxy 2491	. . . . 5 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏∃𝑥 ∈ 𝑎 𝜑)
15	8, 9, 14	nfraldxy 2490	. . . 4 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏∀𝑦 ∈ 𝑧 ∃𝑥 ∈ 𝑎 𝜑)
16	13, 15	nfand 1548	. . 3 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏(∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑧 𝜑 ∧ ∀𝑦 ∈ 𝑧 ∃𝑥 ∈ 𝑎 𝜑))
17		nfv 1508	. . . . . . 7 ⊢ Ⅎ𝑥 𝑧 = 𝑏
18	5, 17	nfan 1545	. . . . . 6 ⊢ Ⅎ𝑥(∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏)
19		rexeq 2653	. . . . . . 7 ⊢ (𝑧 = 𝑏 → (∃𝑦 ∈ 𝑧 𝜑 ↔ ∃𝑦 ∈ 𝑏 𝜑))
20	19	adantl 275	. . . . . 6 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → (∃𝑦 ∈ 𝑧 𝜑 ↔ ∃𝑦 ∈ 𝑏 𝜑))
21	18, 20	ralbid 2455	. . . . 5 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑧 𝜑 ↔ ∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑏 𝜑))
22		nfv 1508	. . . . . . 7 ⊢ Ⅎ𝑦 𝑧 = 𝑏
23	8, 22	nfan 1545	. . . . . 6 ⊢ Ⅎ𝑦(∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏)
24		eleq2 2221	. . . . . . . 8 ⊢ (𝑧 = 𝑏 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑏))
25	24	adantl 275	. . . . . . 7 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑏))
26	25	imbi1d 230	. . . . . 6 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → ((𝑦 ∈ 𝑧 → ∃𝑥 ∈ 𝑎 𝜑) ↔ (𝑦 ∈ 𝑏 → ∃𝑥 ∈ 𝑎 𝜑)))
27	23, 26	ralbid2 2461	. . . . 5 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → (∀𝑦 ∈ 𝑧 ∃𝑥 ∈ 𝑎 𝜑 ↔ ∀𝑦 ∈ 𝑏 ∃𝑥 ∈ 𝑎 𝜑))
28	21, 27	anbi12d 465	. . . 4 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → ((∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑧 𝜑 ∧ ∀𝑦 ∈ 𝑧 ∃𝑥 ∈ 𝑎 𝜑) ↔ (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑏 𝜑 ∧ ∀𝑦 ∈ 𝑏 ∃𝑥 ∈ 𝑎 𝜑)))
29	28	ex 114	. . 3 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → (𝑧 = 𝑏 → ((∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑧 𝜑 ∧ ∀𝑦 ∈ 𝑧 ∃𝑥 ∈ 𝑎 𝜑) ↔ (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑏 𝜑 ∧ ∀𝑦 ∈ 𝑏 ∃𝑥 ∈ 𝑎 𝜑))))
30	4, 16, 29	cbvexd 1907	. 2 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → (∃𝑧(∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑧 𝜑 ∧ ∀𝑦 ∈ 𝑧 ∃𝑥 ∈ 𝑎 𝜑) ↔ ∃𝑏(∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑏 𝜑 ∧ ∀𝑦 ∈ 𝑏 ∃𝑥 ∈ 𝑎 𝜑)))
31	1, 30	syl5ib 153	1 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑏(∀𝑥 ∈ 𝑎 ∃𝑦 ∈ 𝑏 𝜑 ∧ ∀𝑦 ∈ 𝑏 ∃𝑥 ∈ 𝑎 𝜑)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1333  Ⅎwnf 1440  ∃wex 1472  ∀wral 2435  ∃wrex 2436

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2139  ax-strcoll 13516

This theorem depends on definitions:  df-bi 116  df-tru 1338  df-nf 1441  df-sb 1743  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441

This theorem is referenced by:  strcollnf  13519