Theorem fvresval 7366

Description: The value of a restricted function at a class is either the empty set or the value of the unrestricted function at that class. (Contributed by Scott Fenton, 4-Sep-2011.)

Assertion

Ref	Expression
fvresval	⊢ (((𝐹 ↾ 𝐵)‘𝐴) = (𝐹‘𝐴) ∨ ((𝐹 ↾ 𝐵)‘𝐴) = ∅)

Proof of Theorem fvresval

Step	Hyp	Ref	Expression
1		exmid 908	. 2 ⊢ (𝐴 ∈ 𝐵 ∨ ¬ 𝐴 ∈ 𝐵)
2		fvres 6902	. . 3 ⊢ (𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝐴) = (𝐹‘𝐴))
3		nfvres 6921	. . 3 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝐴) = ∅)
4	2, 3	orim12i 922	. 2 ⊢ ((𝐴 ∈ 𝐵 ∨ ¬ 𝐴 ∈ 𝐵) → (((𝐹 ↾ 𝐵)‘𝐴) = (𝐹‘𝐴) ∨ ((𝐹 ↾ 𝐵)‘𝐴) = ∅))
5	1, 4	ax-mp 5	1 ⊢ (((𝐹 ↾ 𝐵)‘𝐴) = (𝐹‘𝐴) ∨ ((𝐹 ↾ 𝐵)‘𝐴) = ∅)

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570   ∈ wcel 2145  ∅c0 4279   ↾ cres 5653  ‘cfv 6537

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-sep 5249  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-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  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-opab 5168  df-xp 5657  df-dm 5661  df-res 5663  df-iota 6493  df-fv 6545

This theorem is used by:  ltsres  28012