| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > abrexss | Structured version Visualization version GIF version | ||
| Description: A necessary condition for an image set to be a subset. (Contributed by Thierry Arnoux, 6-Feb-2017.) |
| Ref | Expression |
|---|---|
| abrexss.1 | ⊢ Ⅎ𝑥𝐶 |
| Ref | Expression |
|---|---|
| abrexss | ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfra1 3289 | . . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 | |
| 2 | abrexss.1 | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
| 3 | 2 | nfcri 2917 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶 |
| 4 | eleq1 2851 | . . . 4 ⊢ (𝑧 = 𝐵 → (𝑧 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) | |
| 5 | vex 3459 | . . . . 5 ⊢ 𝑧 ∈ V | |
| 6 | 5 | a1i 11 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → 𝑧 ∈ V) |
| 7 | rspa 3254 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝐶) | |
| 8 | 1, 3, 4, 6, 7 | elabreximd 32837 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 ∧ 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) → 𝑧 ∈ 𝐶) |
| 9 | 8 | ex 417 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → (𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑧 ∈ 𝐶)) |
| 10 | 9 | ssrdv 3944 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 {cab 2741 Ⅎwnfc 2910 ∀wral 3079 ∃wrex 3089 Vcvv 3455 ⊆ wss 3906 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-12 2213 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-nf 1814 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3080 df-rex 3090 df-v 3457 df-ss 3923 |
| This theorem is referenced by: funimass4f 32963 measvunilem 34583 |
| Copyright terms: Public domain | W3C validator |