Theorem pmresg 8481

Description: Elementhood of a restricted function in the set of partial functions. (Contributed by Mario Carneiro, 31-Dec-2013.)

Assertion

Ref	Expression
pmresg	⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵))

Proof of Theorem pmresg

Step	Hyp	Ref	Expression
1		n0i 4223	. . . . 5 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → ¬ (𝐴 ↑pm 𝐶) = ∅)
2		fnpm 8446	. . . . . . 7 ⊢ ↑pm Fn (V × V)
3	2	fndmi 6442	. . . . . 6 ⊢ dom ↑pm = (V × V)
4	3	ndmov 7349	. . . . 5 ⊢ (¬ (𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ↑pm 𝐶) = ∅)
5	1, 4	nsyl2 143	. . . 4 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → (𝐴 ∈ V ∧ 𝐶 ∈ V))
6	5	simpld 498	. . 3 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → 𝐴 ∈ V)
7	6	adantl 485	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐴 ∈ V)
8		simpl 486	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐵 ∈ 𝑉)
9		elpmi 8457	. . . . . 6 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → (𝐹:dom 𝐹⟶𝐴 ∧ dom 𝐹 ⊆ 𝐶))
10	9	simpld 498	. . . . 5 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → 𝐹:dom 𝐹⟶𝐴)
11	10	adantl 485	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐹:dom 𝐹⟶𝐴)
12		inss1 4120	. . . 4 ⊢ (dom 𝐹 ∩ 𝐵) ⊆ dom 𝐹
13		fssres 6545	. . . 4 ⊢ ((𝐹:dom 𝐹⟶𝐴 ∧ (dom 𝐹 ∩ 𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴)
14	11, 12, 13	sylancl 589	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴)
15		ffun 6508	. . . . 5 ⊢ (𝐹:dom 𝐹⟶𝐴 → Fun 𝐹)
16		resres 5839	. . . . . 6 ⊢ ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ (dom 𝐹 ∩ 𝐵))
17		funrel 6357	. . . . . . 7 ⊢ (Fun 𝐹 → Rel 𝐹)
18		resdm 5871	. . . . . . 7 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
19		reseq1 5820	. . . . . . 7 ⊢ ((𝐹 ↾ dom 𝐹) = 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ 𝐵))
20	17, 18, 19	3syl 18	. . . . . 6 ⊢ (Fun 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ 𝐵))
21	16, 20	eqtr3id 2787	. . . . 5 ⊢ (Fun 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) = (𝐹 ↾ 𝐵))
22	11, 15, 21	3syl 18	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) = (𝐹 ↾ 𝐵))
23	22	feq1d 6490	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → ((𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴 ↔ (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴))
24	14, 23	mpbid 235	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴)
25		inss2 4121	. . 3 ⊢ (dom 𝐹 ∩ 𝐵) ⊆ 𝐵
26		elpm2r 8456	. . 3 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) ∧ ((𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴 ∧ (dom 𝐹 ∩ 𝐵) ⊆ 𝐵)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵))
27	25, 26	mpanr2 704	. 2 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) ∧ (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵))
28	7, 8, 24, 27	syl21anc 837	1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1542   ∈ wcel 2113  Vcvv 3398   ∩ cin 3843   ⊆ wss 3844  ∅c0 4212   × cxp 5524  dom cdm 5526   ↾ cres 5528  Rel wrel 5531  Fun wfun 6334  ⟶wf 6336  (class class class)co 7171   ↑_pm cpm 8439

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2161  ax-12 2178  ax-ext 2710  ax-sep 5168  ax-nul 5175  ax-pow 5233  ax-pr 5297  ax-un 7480

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-ral 3058  df-rex 3059  df-rab 3062  df-v 3400  df-sbc 3683  df-csb 3792  df-dif 3847  df-un 3849  df-in 3851  df-ss 3861  df-nul 4213  df-if 4416  df-pw 4491  df-sn 4518  df-pr 4520  df-op 4524  df-uni 4798  df-iun 4884  df-br 5032  df-opab 5094  df-mpt 5112  df-id 5430  df-xp 5532  df-rel 5533  df-cnv 5534  df-co 5535  df-dm 5536  df-rn 5537  df-res 5538  df-ima 5539  df-iota 6298  df-fun 6342  df-fn 6343  df-f 6344  df-fv 6348  df-ov 7174  df-oprab 7175  df-mpo 7176  df-1st 7715  df-2nd 7716  df-pm 8441

This theorem is referenced by:  lmres  22052  mbfres  24397  dvnres  24683  cpnres  24689  caures  35538