Theorem mpoxneldm 8204

Description: If the first argument of an operation given by a maps-to rule is not an element of the first component of the domain or the second argument is not an element of the second component of the domain depending on the first argument, then the value of the operation is the empty set. (Contributed by AV, 25-Oct-2020.)

Hypothesis

Ref	Expression
mpoxeldm.f	⊢ 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)

Assertion

Ref	Expression
mpoxneldm	⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅)

Distinct variable groups:   𝑥,𝐶,𝑦   𝑦,𝐷   𝑥,𝑋   𝑥,𝑌

Allowed substitution hints:   𝐷(𝑥)   𝑅(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝑋(𝑦)   𝑌(𝑦)

Proof of Theorem mpoxneldm

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nel 3065	. . . 4 ⊢ (𝑋 ∉ 𝐶 ↔ ¬ 𝑋 ∈ 𝐶)
2		df-nel 3065	. . . 4 ⊢ (𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷 ↔ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷)
3	1, 2	orbi12i 927	. . 3 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) ↔ (¬ 𝑋 ∈ 𝐶 ∨ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷))
4		ianor 997	. . 3 ⊢ (¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) ↔ (¬ 𝑋 ∈ 𝐶 ∨ ¬ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷))
5	3, 4	bitr4i 281	. 2 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) ↔ ¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷))
6		neq0 4306	. . . 4 ⊢ (¬ (𝑋𝐹𝑌) = ∅ ↔ ∃𝑛 𝑛 ∈ (𝑋𝐹𝑌))
7		mpoxeldm.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
8	7	mpoxeldm 8203	. . . . 5 ⊢ (𝑛 ∈ (𝑋𝐹𝑌) → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷))
9	8	exlimiv 1960	. . . 4 ⊢ (∃𝑛 𝑛 ∈ (𝑋𝐹𝑌) → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷))
10	6, 9	sylbi 220	. . 3 ⊢ (¬ (𝑋𝐹𝑌) = ∅ → (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷))
11	10	con1i 148	. 2 ⊢ (¬ (𝑋 ∈ 𝐶 ∧ 𝑌 ∈ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅)
12	5, 11	sylbi 220	1 ⊢ ((𝑋 ∉ 𝐶 ∨ 𝑌 ∉ ⦋𝑋 / 𝑥⦌𝐷) → (𝑋𝐹𝑌) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1570  ∃wex 1809   ∈ wcel 2143   ∉ wnel 3064  ⦋csb 3853  ∅c0 4286  (class class class)co 7410   ∈ cmpo 7412

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983

This theorem is referenced by:  nbgrnvtx0  29689  clnbgrnvtx0  48612