Theorem nelrnmpt 42634

Description: Non-membership in the range of a function in maps-to notaion. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

Hypotheses

Ref	Expression
nelrnmpt.x	⊢ Ⅎ𝑥𝜑
nelrnmpt.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
nelrnmpt.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
nelrnmpt.n	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ≠ 𝐵)

Assertion

Ref	Expression
nelrnmpt	⊢ (𝜑 → ¬ 𝐶 ∈ ran 𝐹)

Distinct variable group:   𝑥,𝐶

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem nelrnmpt

Step	Hyp	Ref	Expression
1		nelrnmpt.x	. . . 4 ⊢ Ⅎ𝑥𝜑
2		nelrnmpt.n	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ≠ 𝐵)
3	2	neneqd 2948	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ 𝐶 = 𝐵)
4	3	ex 413	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → ¬ 𝐶 = 𝐵))
5	1, 4	ralrimi 3141	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ¬ 𝐶 = 𝐵)
6		ralnex 3167	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝐶 = 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)
7	5, 6	sylib 217	. 2 ⊢ (𝜑 → ¬ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)
8		nelrnmpt.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
9		nelrnmpt.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
10	9	elrnmpt 5865	. . 3 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵))
11	8, 10	syl 17	. 2 ⊢ (𝜑 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵))
12	7, 11	mtbird 325	1 ⊢ (𝜑 → ¬ 𝐶 ∈ ran 𝐹)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539  Ⅎwnf 1786   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  ∃wrex 3065   ↦ cmpt 5157  ran crn 5590

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-mpt 5158  df-cnv 5597  df-dm 5599  df-rn 5600

This theorem is referenced by: (None)