Theorem ndmfvrcl 6910

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 6909	. . . . 5 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅)
3	2	eleq1d 2846	. . . 4 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ((𝐹‘𝐴) ∈ 𝑅 ↔ ∅ ∈ 𝑅))
4	1, 3	mtbiri 330	. . 3 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ¬ (𝐹‘𝐴) ∈ 𝑅)
5	4	con4i 115	. 2 ⊢ ((𝐹‘𝐴) ∈ 𝑅 → 𝐴 ∈ dom 𝐹)
6		ndmfvrcl.1	. 2 ⊢ dom 𝐹 = 𝑆
7	5, 6	eleqtrdi 2871	1 ⊢ ((𝐹‘𝐴) ∈ 𝑅 → 𝐴 ∈ 𝑆)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2145  ∅c0 4279  dom cdm 5651  ‘cfv 6531

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-dm 5661  df-iota 6487  df-fv 6539

This theorem is used by:  lterpq  11036  ltrnq  11045  reclem2pr  11114  msrrcl  36277  idfurcl  50150