Theorem nelrnmpt 5956

Description: Non-membership in the range of a function in maps-to notation. (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 2962	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ 𝐶 = 𝐵)
4	3	ex 417	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → ¬ 𝐶 = 𝐵))
5	1, 4	ralrimi 3262	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ¬ 𝐶 = 𝐵)
6		ralnex 3090	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝐶 = 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)
7	5, 6	sylib 221	. 2 ⊢ (𝜑 → ¬ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)
8		nelrnmpt.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
9		nelrnmpt.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
10	9	elrnmpt 5947	. . 3 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵))
11	8, 10	syl 18	. 2 ⊢ (𝜑 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵))
12	7, 11	mtbird 328	1 ⊢ (𝜑 → ¬ 𝐶 ∈ ran 𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569  Ⅎwnf 1812   ∈ wcel 2142   ≠ wne 2957  ∀wral 3078  ∃wrex 3088   ↦ cmpt 5191  ran crn 5661

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-mpt 5192  df-cnv 5668  df-dm 5670  df-rn 5671

This theorem is used by:  deg1prod  33882