Theorem bj-inf2vnlem3 13159

Description: Lemma for bj-inf2vn 13161. (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-inf2vnlem3.bd1	⊢ BOUNDED 𝐴
bj-inf2vnlem3.bd2	⊢ BOUNDED 𝑍

Assertion

Ref	Expression
bj-inf2vnlem3	⊢ (∀𝑥 ∈ 𝐴 (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → (Ind 𝑍 → 𝐴 ⊆ 𝑍))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑍,𝑦

Proof of Theorem bj-inf2vnlem3

Dummy variables 𝑧 𝑡 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bj-inf2vnlem2 13158	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → (Ind 𝑍 → ∀𝑢(∀𝑡 ∈ 𝑢 (𝑡 ∈ 𝐴 → 𝑡 ∈ 𝑍) → (𝑢 ∈ 𝐴 → 𝑢 ∈ 𝑍))))
2		bj-inf2vnlem3.bd1	. . . . . 6 ⊢ BOUNDED 𝐴
3	2	bdeli 13033	. . . . 5 ⊢ BOUNDED 𝑧 ∈ 𝐴
4		bj-inf2vnlem3.bd2	. . . . . 6 ⊢ BOUNDED 𝑍
5	4	bdeli 13033	. . . . 5 ⊢ BOUNDED 𝑧 ∈ 𝑍
6	3, 5	ax-bdim 13001	. . . 4 ⊢ BOUNDED (𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍)
7		nfv 1508	. . . 4 ⊢ Ⅎ𝑧(𝑡 ∈ 𝐴 → 𝑡 ∈ 𝑍)
8		nfv 1508	. . . 4 ⊢ Ⅎ𝑧(𝑢 ∈ 𝐴 → 𝑢 ∈ 𝑍)
9		nfv 1508	. . . 4 ⊢ Ⅎ𝑢(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍)
10		nfv 1508	. . . 4 ⊢ Ⅎ𝑢(𝑡 ∈ 𝐴 → 𝑡 ∈ 𝑍)
11		eleq1 2200	. . . . . 6 ⊢ (𝑧 = 𝑡 → (𝑧 ∈ 𝐴 ↔ 𝑡 ∈ 𝐴))
12		eleq1 2200	. . . . . 6 ⊢ (𝑧 = 𝑡 → (𝑧 ∈ 𝑍 ↔ 𝑡 ∈ 𝑍))
13	11, 12	imbi12d 233	. . . . 5 ⊢ (𝑧 = 𝑡 → ((𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍) ↔ (𝑡 ∈ 𝐴 → 𝑡 ∈ 𝑍)))
14	13	biimpd 143	. . . 4 ⊢ (𝑧 = 𝑡 → ((𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍) → (𝑡 ∈ 𝐴 → 𝑡 ∈ 𝑍)))
15		eleq1 2200	. . . . . 6 ⊢ (𝑧 = 𝑢 → (𝑧 ∈ 𝐴 ↔ 𝑢 ∈ 𝐴))
16		eleq1 2200	. . . . . 6 ⊢ (𝑧 = 𝑢 → (𝑧 ∈ 𝑍 ↔ 𝑢 ∈ 𝑍))
17	15, 16	imbi12d 233	. . . . 5 ⊢ (𝑧 = 𝑢 → ((𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍) ↔ (𝑢 ∈ 𝐴 → 𝑢 ∈ 𝑍)))
18	17	biimprd 157	. . . 4 ⊢ (𝑧 = 𝑢 → ((𝑢 ∈ 𝐴 → 𝑢 ∈ 𝑍) → (𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍)))
19	6, 7, 8, 9, 10, 14, 18	bdsetindis 13156	. . 3 ⊢ (∀𝑢(∀𝑡 ∈ 𝑢 (𝑡 ∈ 𝐴 → 𝑡 ∈ 𝑍) → (𝑢 ∈ 𝐴 → 𝑢 ∈ 𝑍)) → ∀𝑧(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍))
20	1, 19	syl6 33	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → (Ind 𝑍 → ∀𝑧(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍)))
21		dfss2 3081	. 2 ⊢ (𝐴 ⊆ 𝑍 ↔ ∀𝑧(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝑍))
22	20, 21	syl6ibr 161	1 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → (Ind 𝑍 → 𝐴 ⊆ 𝑍))

Syntax hints:   → wi 4   ∨ wo 697  ∀wal 1329   = wceq 1331   ∈ wcel 1480  ∀wral 2414  ∃wrex 2415   ⊆ wss 3066  ∅c0 3358  suc csuc 4282  BOUNDED wbdc 13027  Ind wind 13113

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-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-bdim 13001  ax-bdsetind 13155

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-sn 3528  df-suc 4288  df-bdc 13028  df-bj-ind 13114

This theorem is referenced by:  bj-inf2vn  13161