![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ndmfvrcl | Structured version Visualization version GIF version |
Description: Reverse closure law for function with the empty set not in its domain. (Contributed by NM, 26-Apr-1996.) |
Ref | Expression |
---|---|
ndmfvrcl.1 | ⊢ dom 𝐹 = 𝑆 |
ndmfvrcl.2 | ⊢ ¬ ∅ ∈ 𝑆 |
Ref | Expression |
---|---|
ndmfvrcl | ⊢ ((𝐹‘𝐴) ∈ 𝑆 → 𝐴 ∈ 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ndmfvrcl.2 | . . . 4 ⊢ ¬ ∅ ∈ 𝑆 | |
2 | ndmfv 6955 | . . . . 5 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅) | |
3 | 2 | eleq1d 2829 | . . . 4 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ((𝐹‘𝐴) ∈ 𝑆 ↔ ∅ ∈ 𝑆)) |
4 | 1, 3 | mtbiri 327 | . . 3 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ¬ (𝐹‘𝐴) ∈ 𝑆) |
5 | 4 | con4i 114 | . 2 ⊢ ((𝐹‘𝐴) ∈ 𝑆 → 𝐴 ∈ dom 𝐹) |
6 | ndmfvrcl.1 | . 2 ⊢ dom 𝐹 = 𝑆 | |
7 | 5, 6 | eleqtrdi 2854 | 1 ⊢ ((𝐹‘𝐴) ∈ 𝑆 → 𝐴 ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1537 ∈ wcel 2108 ∅c0 4352 dom cdm 5700 ‘cfv 6573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-dm 5710 df-iota 6525 df-fv 6581 |
This theorem is referenced by: lterpq 11039 ltrnq 11048 reclem2pr 11117 msrrcl 35511 |
Copyright terms: Public domain | W3C validator |