| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > marypha2lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for marypha2 9406. 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 5011 | . . 3 ⊢ (∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹) ↔ ∀𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) | |
| 3 | snssi 4753 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 4 | fvssunirn 6916 | . . . 4 ⊢ (𝐹‘𝑥) ⊆ ∪ ran 𝐹 | |
| 5 | xpss12 5678 | . . . 4 ⊢ (({𝑥} ⊆ 𝐴 ∧ (𝐹‘𝑥) ⊆ ∪ ran 𝐹) → ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) | |
| 6 | 3, 4, 5 | sylancl 598 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) |
| 7 | 2, 6 | mprgbir 3088 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹) |
| 8 | 1, 7 | eqsstri 3984 | 1 ⊢ 𝑇 ⊆ (𝐴 × ∪ ran 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 ⊆ wss 3906 {csn 4591 ∪ cuni 4874 ∪ ciun 4958 × cxp 5661 ran crn 5664 ‘cfv 6540 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-xp 5669 df-cnv 5671 df-dm 5673 df-rn 5674 df-iota 6496 df-fv 6548 |
| This theorem is used by: marypha2 9406 |
| Copyright terms: Public domain | W3C validator |