![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nfiung | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for indexed union. Usage of this theorem is discouraged because it depends on ax-13 2374. See nfiun 5049 for a version with more disjoint variable conditions, but not requiring ax-13 2374. (Contributed by Mario Carneiro, 25-Jan-2014.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nfiung.1 | ⊢ Ⅎ𝑦𝐴 |
nfiung.2 | ⊢ Ⅎ𝑦𝐵 |
Ref | Expression |
---|---|
nfiung | ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-iun 5021 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
2 | nfiung.1 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
3 | nfiung.2 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
4 | 3 | nfcri 2895 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
5 | 2, 4 | nfrex 3378 | . . 3 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 |
6 | 5 | nfabg 2911 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} |
7 | 1, 6 | nfcxfr 2902 | 1 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2103 {cab 2711 Ⅎwnfc 2888 ∃wrex 3072 ∪ ciun 5019 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2105 ax-9 2113 ax-10 2136 ax-11 2153 ax-12 2173 ax-13 2374 ax-ext 2705 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2890 df-ral 3064 df-rex 3073 df-iun 5021 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |