| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfun | Structured version Visualization version 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.) Avoid ax-10 2147, ax-11 2163, ax-12 2185. (Revised by SN, 14-May-2025.) |
| Ref | Expression |
|---|---|
| nfun.1 | ⊢ Ⅎ𝑥𝐴 |
| nfun.2 | ⊢ Ⅎ𝑥𝐵 |
| Ref | Expression |
|---|---|
| nfun | ⊢ Ⅎ𝑥(𝐴 ∪ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elun 4107 | . . 3 ⊢ (𝑦 ∈ (𝐴 ∪ 𝐵) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)) | |
| 2 | nfun.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
| 3 | 2 | nfcri 2891 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴 |
| 4 | nfun.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
| 5 | 4 | nfcri 2891 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵 |
| 6 | 3, 5 | nfor 1906 | . . 3 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵) |
| 7 | 1, 6 | nfxfr 1855 | . 2 ⊢ Ⅎ𝑥 𝑦 ∈ (𝐴 ∪ 𝐵) |
| 8 | 7 | nfci 2887 | 1 ⊢ Ⅎ𝑥(𝐴 ∪ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ∨ wo 848 ∈ wcel 2114 Ⅎwnfc 2884 ∪ cun 3901 |
| 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-ext 2709 |
| 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 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-v 3444 df-un 3908 |
| This theorem is referenced by: nfsymdif 4211 csbun 4395 iunxdif3 5052 nfsuc 6399 nfsup 9366 nfdju 9831 iunconn 23384 nosupbnd2 27696 noinfbnd2 27711 ordtconnlem1 34102 esumsplit 34231 measvuni 34392 bnj958 35116 bnj1000 35117 bnj1408 35212 bnj1446 35221 bnj1447 35222 bnj1448 35223 bnj1466 35229 bnj1467 35230 rdgssun 37633 exrecfnlem 37634 poimirlem16 37887 poimirlem19 37890 pimxrneun 45846 pimrecltpos 47066 |
| Copyright terms: Public domain | W3C validator |