![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nfun | GIF version |
Description: Bound-variable hypothesis builder for the union of classes. (Contributed by NM, 15-Sep-2003.) (Revised by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
nfun.1 | ⊢ Ⅎ𝑥𝐴 |
nfun.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
nfun | ⊢ Ⅎ𝑥(𝐴 ∪ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-un 2922 | . 2 ⊢ (𝐴 ∪ 𝐵) = {𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)} | |
2 | nfun.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | nfcri 2172 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴 |
4 | nfun.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
5 | 4 | nfcri 2172 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵 |
6 | 3, 5 | nfor 1466 | . . 3 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵) |
7 | 6 | nfab 2182 | . 2 ⊢ Ⅎ𝑥{𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)} |
8 | 1, 7 | nfcxfr 2175 | 1 ⊢ Ⅎ𝑥(𝐴 ∪ 𝐵) |
Colors of variables: wff set class |
Syntax hints: ∨ wo 629 ∈ wcel 1393 {cab 2026 Ⅎwnfc 2165 ∪ cun 2915 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-un 2922 |
This theorem is referenced by: nfsuc 4145 |
Copyright terms: Public domain | W3C validator |