Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfiu1 | GIF version |
Description: Bound-variable hypothesis builder for indexed union. (Contributed by NM, 12-Oct-2003.) |
Ref | Expression |
---|---|
nfiu1 | ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-iun 3868 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} | |
2 | nfre1 2509 | . . 3 ⊢ Ⅎ𝑥∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 | |
3 | 2 | nfab 2313 | . 2 ⊢ Ⅎ𝑥{𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} |
4 | 1, 3 | nfcxfr 2305 | 1 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵 |
Colors of variables: wff set class |
Syntax hints: ∈ wcel 2136 {cab 2151 Ⅎwnfc 2295 ∃wrex 2445 ∪ ciun 3866 |
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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rex 2450 df-iun 3868 |
This theorem is referenced by: ssiun2s 3910 triun 4093 eliunxp 4743 opeliunxp2 4744 opeliunxp2f 6206 ixpf 6686 ctiunctlemfo 12372 |
Copyright terms: Public domain | W3C validator |