| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > marypha2lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for marypha2 9352. 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 4987 | . . 3 ⊢ (∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹) ↔ ∀𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) | |
| 3 | snssi 4729 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 4 | fvssunirn 6871 | . . . 4 ⊢ (𝐹‘𝑥) ⊆ ∪ ran 𝐹 | |
| 5 | xpss12 5646 | . . . 4 ⊢ (({𝑥} ⊆ 𝐴 ∧ (𝐹‘𝑥) ⊆ ∪ ran 𝐹) → ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) | |
| 6 | 3, 4, 5 | sylancl 587 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)) |
| 7 | 2, 6 | mprgbir 3058 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹) |
| 8 | 1, 7 | eqsstri 3968 | 1 ⊢ 𝑇 ⊆ (𝐴 × ∪ ran 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 ⊆ wss 3889 {csn 4567 ∪ cuni 4850 ∪ ciun 4933 × cxp 5629 ran crn 5632 ‘cfv 6498 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-xp 5637 df-cnv 5639 df-dm 5641 df-rn 5642 df-iota 6454 df-fv 6506 |
| This theorem is referenced by: marypha2 9352 |
| Copyright terms: Public domain | W3C validator |