| 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 2370. See nfiung 4975 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 4943 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
| 2 | nfiun.1 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
| 3 | nfiun.2 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
| 4 | 3 | nfcri 2883 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
| 5 | 2, 4 | nfrexw 3277 | . . 3 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 |
| 6 | 5 | nfab 2897 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} |
| 7 | 1, 6 | nfcxfr 2889 | 1 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2109 {cab 2707 Ⅎwnfc 2876 ∃wrex 3053 ∪ ciun 4941 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ral 3045 df-rex 3054 df-iun 4943 |
| This theorem is referenced by: iunab 5000 disjxiun 5089 ttrclselem1 9621 ttrclselem2 9622 ovoliunnul 25406 iunxpssiun1 32512 iundisjf 32533 iundisj2f 32534 iundisjfi 32740 iundisj2fi 32741 bnj1498 35034 ss2iundf 43642 nfcoll 44239 fnlimcnv 45658 fnlimfvre 45665 fnlimabslt 45670 smfaddlem1 46754 smflimlem6 46767 smflim 46768 smfmullem4 46785 smflim2 46797 smflimsup 46819 smfliminf 46822 fsupdm 46833 finfdm 46837 |
| Copyright terms: Public domain | W3C validator |