| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssiun | Structured version Visualization version GIF version | ||
| Description: Subset implication for an indexed union. (Contributed by NM, 3-Sep-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| ssiun | ⊢ (∃𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 3907 | . . . . 5 ⊢ (𝐶 ⊆ 𝐵 → (𝑦 ∈ 𝐶 → 𝑦 ∈ 𝐵)) | |
| 2 | 1 | reximi 3104 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐶 → 𝑦 ∈ 𝐵)) |
| 3 | r19.37v 3192 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐶 → 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
| 4 | 2, 3 | syl 18 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → (𝑦 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
| 5 | eliun 4960 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 6 | 4, 5 | imbitrrdi 255 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → (𝑦 ∈ 𝐶 → 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵)) |
| 7 | 6 | ssrdv 3919 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2147 ∃wrex 3090 ⊆ wss 3900 ∪ ciun 4956 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-v 3456 df-ss 3901 df-iun 4958 |
| This theorem is used by: iunss2 5013 iunpwss 5072 iunpw 7817 onfununi 8387 oen0 8633 trcl 9766 rtrclreclem1 15253 rtrclreclem2 15255 constrmon 34487 nmulprop 37154 oacl2g 44654 omcl2 44657 ofoaf 44679 iunlub 50324 iuneqconst2 50326 |
| Copyright terms: Public domain | W3C validator |