| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > marypha2lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for marypha2 9441. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.) |
| Ref | Expression |
|---|---|
| marypha2lem.t | ⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) |
| Ref | Expression |
|---|---|
| marypha2lem1 | ⊢ 𝑇 ⊆ (𝐴 × ∪ ran 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | marypha2lem.t | . 2 ⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) | |
| 2 | iunss 5005 | . . 3 ⊢ (∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹) ↔ ∀𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) | |
| 3 | snssi 4745 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 4 | fvssunirn 6924 | . . . 4 ⊢ (𝐹‘𝑥) ⊆ ∪ ran 𝐹 | |
| 5 | xpss12 5669 | . . . 4 ⊢ (({𝑥} ⊆ 𝐴 ∧ (𝐹‘𝑥) ⊆ ∪ ran 𝐹) → ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) | |
| 6 | 3, 4, 5 | sylancl 598 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) |
| 7 | 2, 6 | mprgbir 3086 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹) |
| 8 | 1, 7 | eqsstri 3958 | 1 ⊢ 𝑇 ⊆ (𝐴 × ∪ ran 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2146 ⊆ wss 3899 {csn 4587 ∪ cuni 4869 ∪ ciun 4953 × cxp 5652 ran crn 5655 ‘cfv 6546 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-xp 5660 df-cnv 5662 df-dm 5664 df-rn 5665 df-iota 6500 df-fv 6554 |
| This theorem is used by: marypha2 9441 |
| Copyright terms: Public domain | W3C validator |