![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > rnmposs | Structured version Visualization version GIF version |
Description: The range of an operation given by the maps-to notation as a subset. (Contributed by Thierry Arnoux, 23-May-2017.) |
Ref | Expression |
---|---|
rnmposs.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
Ref | Expression |
---|---|
rnmposs | ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → ran 𝐹 ⊆ 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rnmposs.1 | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
2 | 1 | rnmpo 7539 | . . . 4 ⊢ ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} |
3 | 2 | eqabri 2878 | . . 3 ⊢ (𝑧 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶) |
4 | 2r19.29 3140 | . . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶)) | |
5 | eleq1 2822 | . . . . . . . 8 ⊢ (𝑧 = 𝐶 → (𝑧 ∈ 𝐷 ↔ 𝐶 ∈ 𝐷)) | |
6 | 5 | biimparc 481 | . . . . . . 7 ⊢ ((𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶) → 𝑧 ∈ 𝐷) |
7 | 6 | a1i 11 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ((𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶) → 𝑧 ∈ 𝐷)) |
8 | 7 | rexlimivv 3200 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶) → 𝑧 ∈ 𝐷) |
9 | 4, 8 | syl 17 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶) → 𝑧 ∈ 𝐷) |
10 | 9 | ex 414 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
11 | 3, 10 | biimtrid 241 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → (𝑧 ∈ ran 𝐹 → 𝑧 ∈ 𝐷)) |
12 | 11 | ssrdv 3988 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → ran 𝐹 ⊆ 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 ⊆ wss 3948 ran crn 5677 ∈ cmpo 7408 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-opab 5211 df-cnv 5684 df-dm 5686 df-rn 5687 df-oprab 7410 df-mpo 7411 |
This theorem is referenced by: fedgmul 32705 raddcn 32898 br2base 33257 sxbrsiga 33278 |
Copyright terms: Public domain | W3C validator |