Theorem ndmfvrcl 6919

Description: Reverse closure law for function with the empty set not in its domain (if 𝑅 = 𝑆). (Contributed by NM, 26-Apr-1996.) The class containing the function value does not have to be the domain. (Revised by Zhi Wang, 10-Nov-2025.)

Hypotheses

Ref	Expression
ndmfvrcl.1	⊢ dom 𝐹 = 𝑆
ndmfvrcl.2	⊢ ¬ ∅ ∈ 𝑅

Assertion

Ref	Expression
ndmfvrcl	⊢ ((𝐹‘𝐴) ∈ 𝑅 → 𝐴 ∈ 𝑆)

Proof of Theorem ndmfvrcl

Step	Hyp	Ref	Expression
1		ndmfvrcl.2	. . . 4 ⊢ ¬ ∅ ∈ 𝑅
2		ndmfv 6918	. . . . 5 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅)
3	2	eleq1d 2845	. . . 4 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ((𝐹‘𝐴) ∈ 𝑅 ↔ ∅ ∈ 𝑅))
4	1, 3	mtbiri 330	. . 3 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ¬ (𝐹‘𝐴) ∈ 𝑅)
5	4	con4i 115	. 2 ⊢ ((𝐹‘𝐴) ∈ 𝑅 → 𝐴 ∈ dom 𝐹)
6		ndmfvrcl.1	. 2 ⊢ dom 𝐹 = 𝑆
7	5, 6	eleqtrdi 2870	1 ⊢ ((𝐹‘𝐴) ∈ 𝑅 → 𝐴 ∈ 𝑆)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2144  ∅c0 4278  dom cdm 5650  ‘cfv 6539

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-dm 5660  df-iota 6494  df-fv 6547

This theorem is used by:  lterpq  11059  ltrnq  11068  reclem2pr  11137  msrrcl  36395  idfurcl  50308