| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 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 3468 | . 2 ⊢ 𝑥 ∈ V | |
| 2 | setind 9753 | . . . . 5 ⊢ (∀𝑧(𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑}) → {𝑥 ∣ 𝜑} = V) | |
| 3 | dfss3 3952 | . . . . . . 7 ⊢ (𝑧 ⊆ {𝑥 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑}) | |
| 4 | df-sbc 3771 | . . . . . . . . 9 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑}) | |
| 5 | 4 | ralbii 3083 | . . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑}) |
| 6 | nfcv 2899 | . . . . . . . . . . 11 ⊢ Ⅎ𝑥𝑧 | |
| 7 | nfsbc1v 3790 | . . . . . . . . . . 11 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑 | |
| 8 | 6, 7 | nfralw 3295 | . . . . . . . . . 10 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 |
| 9 | nfsbc1v 3790 | . . . . . . . . . 10 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑 | |
| 10 | 8, 9 | nfim 1896 | . . . . . . . . 9 ⊢ Ⅎ𝑥(∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑) |
| 11 | raleq 3306 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑)) | |
| 12 | sbceq1a 3781 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑)) | |
| 13 | 11, 12 | imbi12d 344 | . . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) ↔ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑))) |
| 14 | setinds.1 | . . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) | |
| 15 | 10, 13, 14 | chvarfv 2241 | . . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑧 [𝑦 / 𝑥]𝜑 → [𝑧 / 𝑥]𝜑) |
| 16 | 5, 15 | sylbir 235 | . . . . . . 7 ⊢ (∀𝑦 ∈ 𝑧 𝑦 ∈ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑) |
| 17 | 3, 16 | sylbi 217 | . . . . . 6 ⊢ (𝑧 ⊆ {𝑥 ∣ 𝜑} → [𝑧 / 𝑥]𝜑) |
| 18 | df-sbc 3771 | . . . . . 6 ⊢ ([𝑧 / 𝑥]𝜑 ↔ 𝑧 ∈ {𝑥 ∣ 𝜑}) | |
| 19 | 17, 18 | sylib 218 | . . . . 5 ⊢ (𝑧 ⊆ {𝑥 ∣ 𝜑} → 𝑧 ∈ {𝑥 ∣ 𝜑}) |
| 20 | 2, 19 | mpg 1797 | . . . 4 ⊢ {𝑥 ∣ 𝜑} = V |
| 21 | 20 | eqcomi 2745 | . . 3 ⊢ V = {𝑥 ∣ 𝜑} |
| 22 | 21 | eqabri 2879 | . 2 ⊢ (𝑥 ∈ V ↔ 𝜑) |
| 23 | 1, 22 | mpbi 230 | 1 ⊢ 𝜑 |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 {cab 2714 ∀wral 3052 Vcvv 3464 [wsbc 3770 ⊆ wss 3931 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pr 5407 ax-un 7734 ax-reg 9611 ax-inf2 9660 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-om 7867 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 |
| This theorem is referenced by: setinds2f 35802 |
| Copyright terms: Public domain | W3C validator |