Theorem bdsetindis 17166

Description: Axiom of bounded set induction using implicit substitutions. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bdsetindis.bd	⊢ BOUNDED 𝜑
bdsetindis.nf0	⊢ Ⅎ𝑥𝜓
bdsetindis.nf1	⊢ Ⅎ𝑥𝜒
bdsetindis.nf2	⊢ Ⅎ𝑦𝜑
bdsetindis.nf3	⊢ Ⅎ𝑦𝜓
bdsetindis.1	⊢ (𝑥 = 𝑧 → (𝜑 → 𝜓))
bdsetindis.2	⊢ (𝑥 = 𝑦 → (𝜒 → 𝜑))

Assertion

Ref	Expression
bdsetindis	⊢ (∀𝑦(∀𝑧 ∈ 𝑦 𝜓 → 𝜒) → ∀𝑥𝜑)

Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦, 𝑧)   𝜒(𝑥, 𝑦, 𝑧)

Proof of Theorem bdsetindis

Step	Hyp	Ref	Expression
1		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑥𝑦
2		bdsetindis.nf0	. . . . 5 ⊢ Ⅎ𝑥𝜓
3	1, 2	nfralxy 2588	. . . 4 ⊢ Ⅎ𝑥∀𝑧 ∈ 𝑦 𝜓
4		bdsetindis.nf1	. . . 4 ⊢ Ⅎ𝑥𝜒
5	3, 4	nfim 1625	. . 3 ⊢ Ⅎ𝑥(∀𝑧 ∈ 𝑦 𝜓 → 𝜒)
6		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑦𝑥
7		bdsetindis.nf3	. . . . 5 ⊢ Ⅎ𝑦𝜓
8	6, 7	nfralxy 2588	. . . 4 ⊢ Ⅎ𝑦∀𝑧 ∈ 𝑥 𝜓
9		bdsetindis.nf2	. . . 4 ⊢ Ⅎ𝑦𝜑
10	8, 9	nfim 1625	. . 3 ⊢ Ⅎ𝑦(∀𝑧 ∈ 𝑥 𝜓 → 𝜑)
11		raleq 2749	. . . . 5 ⊢ (𝑦 = 𝑥 → (∀𝑧 ∈ 𝑦 𝜓 ↔ ∀𝑧 ∈ 𝑥 𝜓))
12	11	biimprd 158	. . . 4 ⊢ (𝑦 = 𝑥 → (∀𝑧 ∈ 𝑥 𝜓 → ∀𝑧 ∈ 𝑦 𝜓))
13		bdsetindis.2	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜒 → 𝜑))
14	13	equcoms 1760	. . . 4 ⊢ (𝑦 = 𝑥 → (𝜒 → 𝜑))
15	12, 14	imim12d 74	. . 3 ⊢ (𝑦 = 𝑥 → ((∀𝑧 ∈ 𝑦 𝜓 → 𝜒) → (∀𝑧 ∈ 𝑥 𝜓 → 𝜑)))
16	5, 10, 15	cbv3 1795	. 2 ⊢ (∀𝑦(∀𝑧 ∈ 𝑦 𝜓 → 𝜒) → ∀𝑥(∀𝑧 ∈ 𝑥 𝜓 → 𝜑))
17		bdsetindis.1	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝜑 → 𝜓))
18	2, 17	bj-sbime 16972	. . . . 5 ⊢ ([𝑧 / 𝑥]𝜑 → 𝜓)
19	18	ralimi 2613	. . . 4 ⊢ (∀𝑧 ∈ 𝑥 [𝑧 / 𝑥]𝜑 → ∀𝑧 ∈ 𝑥 𝜓)
20	19	imim1i 60	. . 3 ⊢ ((∀𝑧 ∈ 𝑥 𝜓 → 𝜑) → (∀𝑧 ∈ 𝑥 [𝑧 / 𝑥]𝜑 → 𝜑))
21	20	alimi 1508	. 2 ⊢ (∀𝑥(∀𝑧 ∈ 𝑥 𝜓 → 𝜑) → ∀𝑥(∀𝑧 ∈ 𝑥 [𝑧 / 𝑥]𝜑 → 𝜑))
22		bdsetindis.bd	. . 3 ⊢ BOUNDED 𝜑
23	22	ax-bdsetind 17165	. 2 ⊢ (∀𝑥(∀𝑧 ∈ 𝑥 [𝑧 / 𝑥]𝜑 → 𝜑) → ∀𝑥𝜑)
24	16, 21, 23	3syl 17	1 ⊢ (∀𝑦(∀𝑧 ∈ 𝑦 𝜓 → 𝜒) → ∀𝑥𝜑)

This proof depends on syntax axioms:   → wi 4  ∀wal 1400  Ⅎwnf 1513  [wsb 1815  ∀wral 2528  BOUNDED wbd 17009

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-bdsetind 17165

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533

This theorem is used by:  bj-inf2vnlem3  17169