| 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 2376. See nfiung 4967 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 4935 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
| 2 | nfiun.1 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
| 3 | nfiun.2 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
| 4 | 3 | nfcri 2890 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
| 5 | 2, 4 | nfrexw 3285 | . . 3 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 |
| 6 | 5 | nfab 2904 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} |
| 7 | 1, 6 | nfcxfr 2896 | 1 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 {cab 2714 Ⅎwnfc 2883 ∃wrex 3061 ∪ ciun 4933 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ral 3052 df-rex 3062 df-iun 4935 |
| This theorem is referenced by: iunab 4994 disjxiun 5082 ttrclselem1 9646 ttrclselem2 9647 ovoliunnul 25474 iunxpssiun1 32638 iundisjf 32659 iundisj2f 32660 iundisjfi 32869 iundisj2fi 32870 suppgsumssiun 33133 bnj1498 35203 nfttc 36673 ss2iundf 44086 nfcoll 44683 fnlimcnv 46095 fnlimfvre 46102 fnlimabslt 46107 smfaddlem1 47191 smflimlem6 47204 smflim 47205 smfmullem4 47222 smflim2 47234 smflimsup 47256 smfliminf 47259 fsupdm 47270 finfdm 47274 |
| Copyright terms: Public domain | W3C validator |