Theorem bj-inf2vnlem1 17162

Description: Lemma for bj-inf2vn 17166. Remark: unoptimized proof (have to use more deduction style). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-inf2vnlem1	⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → Ind 𝐴)

Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem bj-inf2vnlem1

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		biimpr 130	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → ((𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → 𝑥 ∈ 𝐴))
2		jaob 722	. . . . . 6 ⊢ (((𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → 𝑥 ∈ 𝐴) ↔ ((𝑥 = ∅ → 𝑥 ∈ 𝐴) ∧ (∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴)))
3	2	biimpi 120	. . . . 5 ⊢ (((𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → 𝑥 ∈ 𝐴) → ((𝑥 = ∅ → 𝑥 ∈ 𝐴) ∧ (∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴)))
4		simpl 109	. . . . . 6 ⊢ (((𝑥 = ∅ → 𝑥 ∈ 𝐴) ∧ (∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴)) → (𝑥 = ∅ → 𝑥 ∈ 𝐴))
5		eleq1 2301	. . . . . 6 ⊢ (𝑥 = ∅ → (𝑥 ∈ 𝐴 ↔ ∅ ∈ 𝐴))
6	4, 5	mpbidi 151	. . . . 5 ⊢ (((𝑥 = ∅ → 𝑥 ∈ 𝐴) ∧ (∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴)) → (𝑥 = ∅ → ∅ ∈ 𝐴))
7	1, 3, 6	3syl 17	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → (𝑥 = ∅ → ∅ ∈ 𝐴))
8	7	alimi 1508	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → ∀𝑥(𝑥 = ∅ → ∅ ∈ 𝐴))
9		exim 1652	. . 3 ⊢ (∀𝑥(𝑥 = ∅ → ∅ ∈ 𝐴) → (∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴))
10		0ex 4260	. . . . . 6 ⊢ ∅ ∈ V
11	10	isseti 2830	. . . . 5 ⊢ ∃𝑥 𝑥 = ∅
12		pm2.27 40	. . . . 5 ⊢ (∃𝑥 𝑥 = ∅ → ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∃𝑥∅ ∈ 𝐴))
13	11, 12	ax-mp 5	. . . 4 ⊢ ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∃𝑥∅ ∈ 𝐴)
14		bj-ex 16956	. . . 4 ⊢ (∃𝑥∅ ∈ 𝐴 → ∅ ∈ 𝐴)
15	13, 14	syl 14	. . 3 ⊢ ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∅ ∈ 𝐴)
16	8, 9, 15	3syl 17	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → ∅ ∈ 𝐴)
17	3	simprd 114	. . . . . 6 ⊢ (((𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦) → 𝑥 ∈ 𝐴) → (∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴))
18	1, 17	syl 14	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → (∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴))
19	18	alimi 1508	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → ∀𝑥(∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴))
20		eqid 2238	. . . . 5 ⊢ suc 𝑧 = suc 𝑧
21		suceq 4547	. . . . . . 7 ⊢ (𝑦 = 𝑧 → suc 𝑦 = suc 𝑧)
22	21	eqeq2d 2250	. . . . . 6 ⊢ (𝑦 = 𝑧 → (suc 𝑧 = suc 𝑦 ↔ suc 𝑧 = suc 𝑧))
23	22	rspcev 2929	. . . . 5 ⊢ ((𝑧 ∈ 𝐴 ∧ suc 𝑧 = suc 𝑧) → ∃𝑦 ∈ 𝐴 suc 𝑧 = suc 𝑦)
24	20, 23	mpan2 429	. . . 4 ⊢ (𝑧 ∈ 𝐴 → ∃𝑦 ∈ 𝐴 suc 𝑧 = suc 𝑦)
25		vex 2824	. . . . . 6 ⊢ 𝑧 ∈ V
26	25	bj-sucex 17115	. . . . 5 ⊢ suc 𝑧 ∈ V
27		eqeq1 2245	. . . . . . 7 ⊢ (𝑥 = suc 𝑧 → (𝑥 = suc 𝑦 ↔ suc 𝑧 = suc 𝑦))
28	27	rexbidv 2551	. . . . . 6 ⊢ (𝑥 = suc 𝑧 → (∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 ↔ ∃𝑦 ∈ 𝐴 suc 𝑧 = suc 𝑦))
29		eleq1 2301	. . . . . 6 ⊢ (𝑥 = suc 𝑧 → (𝑥 ∈ 𝐴 ↔ suc 𝑧 ∈ 𝐴))
30	28, 29	imbi12d 234	. . . . 5 ⊢ (𝑥 = suc 𝑧 → ((∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴) ↔ (∃𝑦 ∈ 𝐴 suc 𝑧 = suc 𝑦 → suc 𝑧 ∈ 𝐴)))
31	26, 30	spcv 2919	. . . 4 ⊢ (∀𝑥(∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦 → 𝑥 ∈ 𝐴) → (∃𝑦 ∈ 𝐴 suc 𝑧 = suc 𝑦 → suc 𝑧 ∈ 𝐴))
32	19, 24, 31	syl2im 38	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → (𝑧 ∈ 𝐴 → suc 𝑧 ∈ 𝐴))
33	32	ralrimiv 2622	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → ∀𝑧 ∈ 𝐴 suc 𝑧 ∈ 𝐴)
34		df-bj-ind 17119	. 2 ⊢ (Ind 𝐴 ↔ (∅ ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 suc 𝑧 ∈ 𝐴))
35	16, 33, 34	sylanbrc 421	1 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝐴 𝑥 = suc 𝑦)) → Ind 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  ∀wal 1400   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ∅c0 3520  suc csuc 4510  Ind wind 17118

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-14 2212  ax-ext 2220  ax-nul 4259  ax-pr 4346  ax-un 4578  ax-bd0 17005  ax-bdor 17008  ax-bdex 17011  ax-bdeq 17012  ax-bdel 17013  ax-bdsep 17076

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-nul 3521  df-sn 3715  df-pr 3716  df-uni 3936  df-suc 4516  df-bj-ind 17119

This theorem is used by:  bj-inf2vn  17166  bj-inf2vn2  17167