Theorem setindel 4636

Description: ∈-Induction in terms of membership in a class. (Contributed by Mario Carneiro and Jim Kingdon, 22-Oct-2018.)

Assertion

Ref	Expression
setindel	⊢ (∀𝑥(∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑆) → 𝑆 = V)

Distinct variable group:   𝑥,𝑦,𝑆

Proof of Theorem setindel

Step	Hyp	Ref	Expression
1		clelsb1 2336	. . . . . . 7 ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝑆 ↔ 𝑦 ∈ 𝑆)
2	1	ralbii 2538	. . . . . 6 ⊢ (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝑥 ∈ 𝑆 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑆)
3		df-ral 2515	. . . . . 6 ⊢ (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑆 ↔ ∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑆))
4	2, 3	bitri 184	. . . . 5 ⊢ (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝑥 ∈ 𝑆 ↔ ∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑆))
5	4	imbi1i 238	. . . 4 ⊢ ((∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝑥 ∈ 𝑆 → 𝑥 ∈ 𝑆) ↔ (∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑆))
6	5	albii 1518	. . 3 ⊢ (∀𝑥(∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝑥 ∈ 𝑆 → 𝑥 ∈ 𝑆) ↔ ∀𝑥(∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑆))
7		ax-setind 4635	. . 3 ⊢ (∀𝑥(∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝑥 ∈ 𝑆 → 𝑥 ∈ 𝑆) → ∀𝑥 𝑥 ∈ 𝑆)
8	6, 7	sylbir 135	. 2 ⊢ (∀𝑥(∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑆) → ∀𝑥 𝑥 ∈ 𝑆)
9		eqv 3514	. 2 ⊢ (𝑆 = V ↔ ∀𝑥 𝑥 ∈ 𝑆)
10	8, 9	sylibr 134	1 ⊢ (∀𝑥(∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝑆) → 𝑆 = V)

Syntax hints:   → wi 4  ∀wal 1395   = wceq 1397  [wsb 1810   ∈ wcel 2202  ∀wral 2510  Vcvv 2802

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-setind 4635

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-ral 2515  df-v 2804

This theorem is referenced by:  setind  4637