Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfiota1 | GIF version |
Description: Bound-variable hypothesis builder for the ℩ class. (Contributed by Andrew Salmon, 11-Jul-2011.) (Revised by Mario Carneiro, 15-Oct-2016.) |
Ref | Expression |
---|---|
nfiota1 | ⊢ Ⅎ𝑥(℩𝑥𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfiota2 5161 | . 2 ⊢ (℩𝑥𝜑) = ∪ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)} | |
2 | nfaba1 2318 | . . 3 ⊢ Ⅎ𝑥{𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)} | |
3 | 2 | nfuni 3802 | . 2 ⊢ Ⅎ𝑥∪ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)} |
4 | 1, 3 | nfcxfr 2309 | 1 ⊢ Ⅎ𝑥(℩𝑥𝜑) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 ∀wal 1346 {cab 2156 Ⅎwnfc 2299 ∪ cuni 3796 ℩cio 5158 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-rex 2454 df-sn 3589 df-uni 3797 df-iota 5160 |
This theorem is referenced by: iota2df 5184 sniota 5189 nfriota1 5816 erovlem 6605 |
Copyright terms: Public domain | W3C validator |