Theorem ndmfvrcl 6944

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

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2147  ∅c0 4281  dom cdm 5656  ‘cfv 6561

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-nul 5264  ax-pr 5396

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-dm 5666  df-iota 6515  df-fv 6569

This theorem is used by:  lterpq  11085  ltrnq  11094  reclem2pr  11163  msrrcl  36488  idfurcl  50429