MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  setinds Structured version   Visualization version   GIF version

Theorem setinds 9734
Description: Principle of set induction (or E-induction). If a property passes from all elements of 𝑥 to 𝑥 itself, then it holds for all 𝑥. (Contributed by Scott Fenton, 10-Mar-2011.)
Hypothesis
Ref Expression
setinds.1 (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑)
Assertion
Ref Expression
setinds 𝜑
Distinct variable groups:   𝜑,𝑦   𝑥,𝑦
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem setinds
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 vex 3455 . 2 𝑥 ∈ V
2 setind 9732 . . . . 5 (∀𝑧(𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑}) → {𝑥 ∣ 𝜑} = V)
3 dfss3 3920 . . . . . . 7 (𝑧 ⊆ {𝑥 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑})
4 df-sbc 3740 . . . . . . . . 9 ([𝑦 / 𝑥]𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑})
54ralbii 3109 . . . . . . . 8 (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑})
6 nfcv 2923 . . . . . . . . . . 11 Ⅎ𝑥𝑧
7 nfsbc1v 3759 . . . . . . . . . . 11 Ⅎ𝑥[𝑦 / 𝑥]𝜑
86, 7nfralw 3310 . . . . . . . . . 10 Ⅎ𝑥∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑
9 nfsbc1v 3759 . . . . . . . . . 10 Ⅎ𝑥[𝑧 / 𝑥]𝜑
108, 9nfim 1929 . . . . . . . . 9 Ⅎ𝑥(∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑)
11 raleq 3317 . . . . . . . . . 10 (𝑥 = 𝑧 → (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑))
12 sbceq1a 3750 . . . . . . . . . 10 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
1311, 12imbi12d 347 . . . . . . . . 9 (𝑥 = 𝑧 → ((∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) ↔ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑)))
14 setinds.1 . . . . . . . . 9 (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑)
1510, 13, 14chvarfv 2277 . . . . . . . 8 (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑)
165, 15sylbir 238 . . . . . . 7 (∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑)
173, 16sylbi 220 . . . . . 6 (𝑧 ⊆ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑)
18 df-sbc 3740 . . . . . 6 ([𝑧 / 𝑥]𝜑 ↔ 𝑧 ∈ {𝑥 ∣ 𝜑})
1917, 18sylib 221 . . . . 5 (𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑})
202, 19mpg 1830 . . . 4 {𝑥 ∣ 𝜑} = V
2120eqcomi 2770 . . 3 V = {𝑥 ∣ 𝜑}
2221eqabri 2903 . 2 (𝑥 ∈ V ↔ 𝜑)
231, 22mpbi 233 1 𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077  Vcvv 3451  [wsbc 3739   ⊆ wss 3899
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740  ax-reg 9570  ax-inf2 9626
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402
This theorem is used by:  setinds2f  9735
  Copyright terms: Public domain W3C validator