Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1405 | Structured version Visualization version GIF version |
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj1405.1 | ⊢ (𝜑 → 𝑋 ∈ ∪ 𝑦 ∈ 𝐴 𝐵) |
Ref | Expression |
---|---|
bnj1405 | ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 𝑋 ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1405.1 | . 2 ⊢ (𝜑 → 𝑋 ∈ ∪ 𝑦 ∈ 𝐴 𝐵) | |
2 | eliun 4916 | . 2 ⊢ (𝑋 ∈ ∪ 𝑦 ∈ 𝐴 𝐵 ↔ ∃𝑦 ∈ 𝐴 𝑋 ∈ 𝐵) | |
3 | 1, 2 | sylib 220 | 1 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 𝑋 ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2110 ∃wrex 3139 ∪ ciun 4912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-v 3497 df-iun 4914 |
This theorem is referenced by: bnj1408 32303 bnj1450 32317 bnj1501 32334 |
Copyright terms: Public domain | W3C validator |