Theorem strcollnft 13182

Description: Closed form of strcollnf 13183. Version of ax-strcoll 13180 with one disjoint variable condition removed, the other disjoint variable condition replaced with a non-freeness antecedent, and without initial universal quantifier. (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 13181	. 2 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑧∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑))
2		nfnf1 1523	. . . . 5 ⊢ Ⅎ𝑏Ⅎ𝑏𝜑
3	2	nfal 1555	. . . 4 ⊢ Ⅎ𝑏∀𝑦Ⅎ𝑏𝜑
4	3	nfal 1555	. . 3 ⊢ Ⅎ𝑏∀𝑥∀𝑦Ⅎ𝑏𝜑
5		nfa2 1558	. . . 4 ⊢ Ⅎ𝑦∀𝑥∀𝑦Ⅎ𝑏𝜑
6		nfvd 1509	. . . . 5 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏 𝑦 ∈ 𝑧)
7		nfa1 1521	. . . . . . . 8 ⊢ Ⅎ𝑥∀𝑥Ⅎ𝑏𝜑
8		nfcvd 2282	. . . . . . . 8 ⊢ (∀𝑥Ⅎ𝑏𝜑 → Ⅎ𝑏𝑎)
9		sp 1488	. . . . . . . 8 ⊢ (∀𝑥Ⅎ𝑏𝜑 → Ⅎ𝑏𝜑)
10	7, 8, 9	nfrexdxy 2468	. . . . . . 7 ⊢ (∀𝑥Ⅎ𝑏𝜑 → Ⅎ𝑏∃𝑥 ∈ 𝑎 𝜑)
11	10	sps 1517	. . . . . 6 ⊢ (∀𝑦∀𝑥Ⅎ𝑏𝜑 → Ⅎ𝑏∃𝑥 ∈ 𝑎 𝜑)
12	11	alcoms 1452	. . . . 5 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏∃𝑥 ∈ 𝑎 𝜑)
13	6, 12	nfbid 1567	. . . 4 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑))
14	5, 13	nfald 1733	. . 3 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → Ⅎ𝑏∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑))
15		nfv 1508	. . . . . 6 ⊢ Ⅎ𝑦 𝑧 = 𝑏
16	5, 15	nfan 1544	. . . . 5 ⊢ Ⅎ𝑦(∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏)
17		elequ2 1691	. . . . . . 7 ⊢ (𝑧 = 𝑏 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑏))
18	17	adantl 275	. . . . . 6 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑏))
19	18	bibi1d 232	. . . . 5 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → ((𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) ↔ (𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑)))
20	16, 19	albid 1594	. . . 4 ⊢ ((∀𝑥∀𝑦Ⅎ𝑏𝜑 ∧ 𝑧 = 𝑏) → (∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑)))
21	20	ex 114	. . 3 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → (𝑧 = 𝑏 → (∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑))))
22	4, 14, 21	cbvexd 1899	. 2 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → (∃𝑧∀𝑦(𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑎 𝜑) ↔ ∃𝑏∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑)))
23	1, 22	syl5ib 153	1 ⊢ (∀𝑥∀𝑦Ⅎ𝑏𝜑 → (∀𝑥 ∈ 𝑎 ∃𝑦𝜑 → ∃𝑏∀𝑦(𝑦 ∈ 𝑏 ↔ ∃𝑥 ∈ 𝑎 𝜑)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1329  Ⅎwnf 1436  ∃wex 1468  ∀wral 2416  ∃wrex 2417

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-strcoll 13180

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422

This theorem is referenced by:  strcollnf  13183