Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > 0nelsetpreimafv | Structured version Visualization version GIF version |
Description: The empty set is not an element of the class 𝑃 of all preimages of function values. (Contributed by AV, 6-Mar-2024.) |
Ref | Expression |
---|---|
setpreimafvex.p | ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} |
Ref | Expression |
---|---|
0nelsetpreimafv | ⊢ (𝐹 Fn 𝐴 → ∅ ∉ 𝑃) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preimafvsnel 43614 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)})) | |
2 | n0i 4292 | . . . . . 6 ⊢ (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) → ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅) | |
3 | 1, 2 | syl 17 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅) |
4 | 3 | ralrimiva 3181 | . . . 4 ⊢ (𝐹 Fn 𝐴 → ∀𝑥 ∈ 𝐴 ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅) |
5 | ralnex 3235 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ¬ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)})) | |
6 | eqcom 2827 | . . . . . . 7 ⊢ (∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅) | |
7 | 6 | notbii 322 | . . . . . 6 ⊢ (¬ ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅) |
8 | 7 | ralbii 3164 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ∀𝑥 ∈ 𝐴 ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅) |
9 | 5, 8 | bitr3i 279 | . . . 4 ⊢ (¬ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ∀𝑥 ∈ 𝐴 ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅) |
10 | 4, 9 | sylibr 236 | . . 3 ⊢ (𝐹 Fn 𝐴 → ¬ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)})) |
11 | 0ex 5204 | . . . 4 ⊢ ∅ ∈ V | |
12 | setpreimafvex.p | . . . . 5 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} | |
13 | 12 | elsetpreimafvb 43619 | . . . 4 ⊢ (∅ ∈ V → (∅ ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)}))) |
14 | 11, 13 | ax-mp 5 | . . 3 ⊢ (∅ ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)})) |
15 | 10, 14 | sylnibr 331 | . 2 ⊢ (𝐹 Fn 𝐴 → ¬ ∅ ∈ 𝑃) |
16 | df-nel 3123 | . 2 ⊢ (∅ ∉ 𝑃 ↔ ¬ ∅ ∈ 𝑃) | |
17 | 15, 16 | sylibr 236 | 1 ⊢ (𝐹 Fn 𝐴 → ∅ ∉ 𝑃) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 {cab 2798 ∉ wnel 3122 ∀wral 3137 ∃wrex 3138 Vcvv 3491 ∅c0 4284 {csn 4560 ◡ccnv 5547 “ cima 5551 Fn wfn 6343 ‘cfv 6348 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5196 ax-nul 5203 ax-pr 5323 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-rab 3146 df-v 3493 df-sbc 3769 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-nul 4285 df-if 4461 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5060 df-opab 5122 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-fv 6356 |
This theorem is referenced by: uniimaelsetpreimafv 43631 imasetpreimafvbijlemfv1 43638 |
Copyright terms: Public domain | W3C validator |