| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfiun | Structured version Visualization version GIF version | ||
| Description: Bound-variable hypothesis builder for indexed union. (Contributed by Mario Carneiro, 25-Jan-2014.) Add disjoint variable condition to avoid ax-13 2404. See nfiung 4984 for a less restrictive version requiring more axioms. (Revised by GG, 20-Jan-2024.) |
| Ref | Expression |
|---|---|
| nfiun.1 | ⊢ Ⅎ𝑦𝐴 |
| nfiun.2 | ⊢ Ⅎ𝑦𝐵 |
| Ref | Expression |
|---|---|
| nfiun | ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-iun 4952 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
| 2 | nfiun.1 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
| 3 | nfiun.2 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
| 4 | 3 | nfcri 2917 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
| 5 | 2, 4 | nfrexw 3311 | . . 3 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 |
| 6 | 5 | nfab 2931 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} |
| 7 | 1, 6 | nfcxfr 2923 | 1 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2143 {cab 2741 Ⅎwnfc 2910 ∃wrex 3087 ∪ ciun 4950 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1564 df-ex 1801 df-nf 1805 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3078 df-rex 3088 df-iun 4952 |
| This theorem is referenced by: iunab 5010 disjxiun 5098 ttrclselem1 9681 ttrclselem2 9682 ovoliunnul 25570 iunxpssiun1 32769 iundisjf 32790 iundisj2f 32791 iundisjfi 32999 iundisj2fi 33000 suppgsumssiun 33253 bnj1498 35357 nfttc 36852 ss2iundf 44236 nfcoll 44833 fnlimcnv 46242 fnlimfvre 46249 fnlimabslt 46254 smfaddlem1 47338 smflimlem6 47351 smflim 47352 smfmullem4 47369 smflim2 47381 smflimsup 47403 smfliminf 47406 fsupdm 47417 finfdm 47421 |
| Copyright terms: Public domain | W3C validator |