| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssiun2 | Structured version Visualization version GIF version | ||
| Description: Identity law for subset of an indexed union. (Contributed by NM, 12-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| ssiun2 | ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rspe 3256 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 2 | 1 | ex 418 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
| 3 | eliun 4959 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 4 | 2, 3 | imbitrrdi 255 | . 2 ⊢ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵)) |
| 5 | 4 | ssrdv 3918 | 1 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2150 ∃wrex 3093 ⊆ wss 3899 ∪ ciun 4955 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-12 2219 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1575 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rex 3094 df-v 3455 df-ss 3900 df-iun 4957 |
| This theorem is used by: ssiun2s 5011 disjxiun 5104 triun 5232 iunopeqop 5500 iunopeqopOLD 5501 ixpf 8985 ixpiunwdom 9620 r1sdom 9817 r1val1 9829 rankuni2b 9903 rankval4b 9916 rankval4 9920 cplem1 9986 cplem1OLD 9987 domtriomlem 10558 ac6num 10595 iunfo 10661 iundom2g 10662 pwfseqlem3 10783 inar1 10898 tskuni 10906 iunconnlem 23802 ptclsg 23991 ovoliunlem1 25880 limciun 26271 ssiun2sf 33254 iunxpssiun1 33262 djussxp2 33342 suppovss 33373 bnj906 35672 bnj999 35700 bnj1014 35703 bnj1408 35778 rdgssun 38571 cpcolld 45563 iunmapss 46561 ssmapsn 46562 sge0iunmpt 47761 sge0iun 47762 voliunsge0lem 47815 omeiunltfirp 47862 |
| Copyright terms: Public domain | W3C validator |