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

Theorem setinds 9753
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 3454 . 2 𝑥 ∈ V
2 setind 9751 . . . . 5 (∀𝑧(𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑}) → {𝑥 ∣ 𝜑} = V)
3 dfss3 3897 . . . . . . 7 (𝑧 ⊆ {𝑥 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑})
4 df-sbc 3739 . . . . . . . . 9 ([𝑦 / 𝑥]𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑})
54ralbii 3108 . . . . . . . 8 (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑})
6 nfcv 2922 . . . . . . . . . . 11 Ⅎ𝑥𝑧
7 nfsbc1v 3758 . . . . . . . . . . 11 Ⅎ𝑥[𝑦 / 𝑥]𝜑
86, 7nfralw 3309 . . . . . . . . . 10 Ⅎ𝑥∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑
9 nfsbc1v 3758 . . . . . . . . . 10 Ⅎ𝑥[𝑧 / 𝑥]𝜑
108, 9nfim 1928 . . . . . . . . 9 Ⅎ𝑥(∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑)
11 raleq 3316 . . . . . . . . . 10 (𝑥 = 𝑧 → (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑))
12 sbceq1a 3749 . . . . . . . . . 10 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
1311, 12imbi12d 347 . . . . . . . . 9 (𝑥 = 𝑧 → ((∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) ↔ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑)))
14 setinds.1 . . . . . . . . 9 (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑)
1510, 13, 14chvarfv 2276 . . . . . . . 8 (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑)
165, 15sylbir 238 . . . . . . 7 (∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑)
173, 16sylbi 220 . . . . . 6 (𝑧 ⊆ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑)
18 df-sbc 3739 . . . . . 6 ([𝑧 / 𝑥]𝜑 ↔ 𝑧 ∈ {𝑥 ∣ 𝜑})
1917, 18sylib 221 . . . . 5 (𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑})
202, 19mpg 1829 . . . 4 {𝑥 ∣ 𝜑} = V
2120eqcomi 2769 . . 3 V = {𝑥 ∣ 𝜑}
2221eqabri 2902 . 2 (𝑥 ∈ V ↔ 𝜑)
231, 22mpbi 233 1 𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  Vcvv 3450  [wsbc 3738   ⊆ wss 3895
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751  ax-reg 9589  ax-inf2 9645
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-om 7878  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421
This theorem is used by:  setinds2f  9754
  Copyright terms: Public domain W3C validator