| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > setinds | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| setinds.1 | ⊢ (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) |
| Ref | Expression |
|---|---|
| setinds | ⊢ 𝜑 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3458 | . 2 ⊢ 𝑥 ∈ V | |
| 2 | setind 9775 | . . . . 5 ⊢ (∀𝑧(𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑}) → {𝑥 ∣ 𝜑} = V) | |
| 3 | dfss3 3902 | . . . . . . 7 ⊢ (𝑧 ⊆ {𝑥 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑}) | |
| 4 | df-sbc 3743 | . . . . . . . . 9 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑}) | |
| 5 | 4 | ralbii 3112 | . . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑}) |
| 6 | nfcv 2926 | . . . . . . . . . . 11 ⊢ Ⅎ𝑥𝑧 | |
| 7 | nfsbc1v 3762 | . . . . . . . . . . 11 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑 | |
| 8 | 6, 7 | nfralw 3313 | . . . . . . . . . 10 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 |
| 9 | nfsbc1v 3762 | . . . . . . . . . 10 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑 | |
| 10 | 8, 9 | nfim 1931 | . . . . . . . . 9 ⊢ Ⅎ𝑥(∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑) |
| 11 | raleq 3320 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑)) | |
| 12 | sbceq1a 3753 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑)) | |
| 13 | 11, 12 | imbi12d 347 | . . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) ↔ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑))) |
| 14 | setinds.1 | . . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) | |
| 15 | 10, 13, 14 | chvarfv 2280 | . . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑) |
| 16 | 5, 15 | sylbir 238 | . . . . . . 7 ⊢ (∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑) |
| 17 | 3, 16 | sylbi 220 | . . . . . 6 ⊢ (𝑧 ⊆ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑) |
| 18 | df-sbc 3743 | . . . . . 6 ⊢ ([𝑧 / 𝑥]𝜑 ↔ 𝑧 ∈ {𝑥 ∣ 𝜑}) | |
| 19 | 17, 18 | sylib 221 | . . . . 5 ⊢ (𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑}) |
| 20 | 2, 19 | mpg 1830 | . . . 4 ⊢ {𝑥 ∣ 𝜑} = V |
| 21 | 20 | eqcomi 2772 | . . 3 ⊢ V = {𝑥 ∣ 𝜑} |
| 22 | 21 | eqabri 2906 | . 2 ⊢ (𝑥 ∈ V ↔ 𝜑) |
| 23 | 1, 22 | mpbi 233 | 1 ⊢ 𝜑 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 {cab 2741 ∀wral 3080 Vcvv 3454 [wsbc 3742 ⊆ wss 3900 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7775 ax-reg 9613 ax-inf2 9669 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7446 df-om 7902 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 |
| This theorem is used by: setinds2f 9778 |
| Copyright terms: Public domain | W3C validator |