Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfis2 | GIF version |
Description: Transfinite Induction Schema, using implicit substitution. (Contributed by NM, 18-Aug-1994.) |
Ref | Expression |
---|---|
tfis2.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
tfis2.2 | ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝜓 → 𝜑)) |
Ref | Expression |
---|---|
tfis2 | ⊢ (𝑥 ∈ On → 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1508 | . 2 ⊢ Ⅎ𝑥𝜓 | |
2 | tfis2.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
3 | tfis2.2 | . 2 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝜓 → 𝜑)) | |
4 | 1, 2, 3 | tfis2f 4493 | 1 ⊢ (𝑥 ∈ On → 𝜑) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∈ wcel 1480 ∀wral 2414 Oncon0 4280 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-setind 4447 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rex 2420 df-rab 2423 df-v 2683 df-in 3072 df-ss 3079 df-uni 3732 df-tr 4022 df-iord 4283 df-on 4285 |
This theorem is referenced by: tfis3 4495 tfrlem1 6198 ordiso2 6913 |
Copyright terms: Public domain | W3C validator |