Theorem psrbagcon 14796

Description: The analogue of the statement "0 ≤ 𝐺 ≤ 𝐹 implies 0 ≤ 𝐹 − 𝐺 ≤ 𝐹 " for finite bags. (Contributed by Mario Carneiro, 29-Dec-2014.) Remove a sethood antecedent. (Revised by SN, 5-Aug-2024.)

Hypothesis

Ref	Expression
psrbag.d	⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}

Assertion

Ref	Expression
psrbagcon	⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ((𝐹 ∘𝑓 − 𝐺) ∈ 𝐷 ∧ (𝐹 ∘𝑓 − 𝐺) ∘𝑟 ≤ 𝐹))

Distinct variable groups:   𝑓,𝐹   𝑓,𝐼   𝑓,𝐺

Allowed substitution hint:   𝐷(𝑓)

Proof of Theorem psrbagcon

Dummy variables 𝑥 𝑗 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprl 531	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ (𝑝 ∈ ℕ0 ∧ 𝑞 ∈ ℕ0)) → 𝑝 ∈ ℕ0)
2	1	nn0zd 9684	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ (𝑝 ∈ ℕ0 ∧ 𝑞 ∈ ℕ0)) → 𝑝 ∈ ℤ)
3		simprr 533	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ (𝑝 ∈ ℕ0 ∧ 𝑞 ∈ ℕ0)) → 𝑞 ∈ ℕ0)
4	3	nn0zd 9684	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ (𝑝 ∈ ℕ0 ∧ 𝑞 ∈ ℕ0)) → 𝑞 ∈ ℤ)
5	2, 4	zsubcld 9691	. . . . . 6 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ (𝑝 ∈ ℕ0 ∧ 𝑞 ∈ ℕ0)) → (𝑝 − 𝑞) ∈ ℤ)
6		psrbag.d	. . . . . . . 8 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
7	6	psrbagf 14790	. . . . . . 7 ⊢ (𝐹 ∈ 𝐷 → 𝐹:𝐼⟶ℕ0)
8	7	3ad2ant1 1045	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → 𝐹:𝐼⟶ℕ0)
9		simp2 1025	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → 𝐺:𝐼⟶ℕ0)
10		id 19	. . . . . . . 8 ⊢ (𝐹 ∈ 𝐷 → 𝐹 ∈ 𝐷)
11	7	ffnd 5500	. . . . . . . 8 ⊢ (𝐹 ∈ 𝐷 → 𝐹 Fn 𝐼)
12	10, 11	fndmexd 5547	. . . . . . 7 ⊢ (𝐹 ∈ 𝐷 → 𝐼 ∈ V)
13	12	3ad2ant1 1045	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → 𝐼 ∈ V)
14		inidm 3427	. . . . . 6 ⊢ (𝐼 ∩ 𝐼) = 𝐼
15	5, 8, 9, 13, 13, 14	off 6270	. . . . 5 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐹 ∘𝑓 − 𝐺):𝐼⟶ℤ)
16	15	ffnd 5500	. . . 4 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐹 ∘𝑓 − 𝐺) Fn 𝐼)
17	11	3ad2ant1 1045	. . . . . . 7 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → 𝐹 Fn 𝐼)
18	9	ffnd 5500	. . . . . . 7 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → 𝐺 Fn 𝐼)
19		eqidd 2233	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) = (𝐹‘𝑥))
20		eqidd 2233	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) = (𝐺‘𝑥))
21	8	ffvelcdmda 5803	. . . . . . . . 9 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ℕ0)
22	21	nn0zd 9684	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ℤ)
23	9	ffvelcdmda 5803	. . . . . . . . 9 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ ℕ0)
24	23	nn0zd 9684	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ ℤ)
25	22, 24	zsubcld 9691	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) − (𝐺‘𝑥)) ∈ ℤ)
26	17, 18, 13, 13, 14, 19, 20, 25	ofvalg 6267	. . . . . 6 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → ((𝐹 ∘𝑓 − 𝐺)‘𝑥) = ((𝐹‘𝑥) − (𝐺‘𝑥)))
27		simp3 1026	. . . . . . . . 9 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → 𝐺 ∘𝑟 ≤ 𝐹)
28	18, 17, 13, 13, 14, 20, 19	ofrfval 6266	. . . . . . . . 9 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐺 ∘𝑟 ≤ 𝐹 ↔ ∀𝑥 ∈ 𝐼 (𝐺‘𝑥) ≤ (𝐹‘𝑥)))
29	27, 28	mpbid 147	. . . . . . . 8 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ∀𝑥 ∈ 𝐼 (𝐺‘𝑥) ≤ (𝐹‘𝑥))
30	29	r19.21bi 2630	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ≤ (𝐹‘𝑥))
31		nn0sub 9630	. . . . . . . 8 ⊢ (((𝐺‘𝑥) ∈ ℕ0 ∧ (𝐹‘𝑥) ∈ ℕ0) → ((𝐺‘𝑥) ≤ (𝐹‘𝑥) ↔ ((𝐹‘𝑥) − (𝐺‘𝑥)) ∈ ℕ0))
32	23, 21, 31	syl2anc 411	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → ((𝐺‘𝑥) ≤ (𝐹‘𝑥) ↔ ((𝐹‘𝑥) − (𝐺‘𝑥)) ∈ ℕ0))
33	30, 32	mpbid 147	. . . . . 6 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) − (𝐺‘𝑥)) ∈ ℕ0)
34	26, 33	eqeltrd 2309	. . . . 5 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → ((𝐹 ∘𝑓 − 𝐺)‘𝑥) ∈ ℕ0)
35	34	ralrimiva 2615	. . . 4 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ∀𝑥 ∈ 𝐼 ((𝐹 ∘𝑓 − 𝐺)‘𝑥) ∈ ℕ0)
36		ffnfv 5826	. . . 4 ⊢ ((𝐹 ∘𝑓 − 𝐺):𝐼⟶ℕ0 ↔ ((𝐹 ∘𝑓 − 𝐺) Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 ((𝐹 ∘𝑓 − 𝐺)‘𝑥) ∈ ℕ0))
37	16, 35, 36	sylanbrc 417	. . 3 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐹 ∘𝑓 − 𝐺):𝐼⟶ℕ0)
38		simp1 1024	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → 𝐹 ∈ 𝐷)
39	6	psrbag 14789	. . . . . . 7 ⊢ (𝐼 ∈ V → (𝐹 ∈ 𝐷 ↔ (𝐹:𝐼⟶ℕ0 ∧ (◡𝐹 “ ℕ) ∈ Fin)))
40	13, 39	syl 14	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐹 ∈ 𝐷 ↔ (𝐹:𝐼⟶ℕ0 ∧ (◡𝐹 “ ℕ) ∈ Fin)))
41	38, 40	mpbid 147	. . . . 5 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐹:𝐼⟶ℕ0 ∧ (◡𝐹 “ ℕ) ∈ Fin))
42	41	simprd 114	. . . 4 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (◡𝐹 “ ℕ) ∈ Fin)
43	23	nn0ge0d 9542	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → 0 ≤ (𝐺‘𝑥))
44	21	nn0red 9540	. . . . . . . . 9 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ℝ)
45	23	nn0red 9540	. . . . . . . . 9 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ ℝ)
46	44, 45	subge02d 8799	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → (0 ≤ (𝐺‘𝑥) ↔ ((𝐹‘𝑥) − (𝐺‘𝑥)) ≤ (𝐹‘𝑥)))
47	43, 46	mpbid 147	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) − (𝐺‘𝑥)) ≤ (𝐹‘𝑥))
48	47	ralrimiva 2615	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ∀𝑥 ∈ 𝐼 ((𝐹‘𝑥) − (𝐺‘𝑥)) ≤ (𝐹‘𝑥))
49	16, 17, 13, 13, 14, 26, 19	ofrfval 6266	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ((𝐹 ∘𝑓 − 𝐺) ∘𝑟 ≤ 𝐹 ↔ ∀𝑥 ∈ 𝐼 ((𝐹‘𝑥) − (𝐺‘𝑥)) ≤ (𝐹‘𝑥)))
50	48, 49	mpbird 167	. . . . 5 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐹 ∘𝑓 − 𝐺) ∘𝑟 ≤ 𝐹)
51	6	psrbaglesupp 14793	. . . . 5 ⊢ ((𝐹 ∈ 𝐷 ∧ (𝐹 ∘𝑓 − 𝐺):𝐼⟶ℕ0 ∧ (𝐹 ∘𝑓 − 𝐺) ∘𝑟 ≤ 𝐹) → (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ⊆ (◡𝐹 “ ℕ))
52	38, 37, 50, 51	syl3anc 1274	. . . 4 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ⊆ (◡𝐹 “ ℕ))
53	37	adantr 276	. . . . . . . . 9 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → (𝐹 ∘𝑓 − 𝐺):𝐼⟶ℕ0)
54		simpr 110	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → 𝑗 ∈ (◡𝐹 “ ℕ))
55	17	adantr 276	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → 𝐹 Fn 𝐼)
56		elpreima 5788	. . . . . . . . . . . 12 ⊢ (𝐹 Fn 𝐼 → (𝑗 ∈ (◡𝐹 “ ℕ) ↔ (𝑗 ∈ 𝐼 ∧ (𝐹‘𝑗) ∈ ℕ)))
57	55, 56	syl 14	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → (𝑗 ∈ (◡𝐹 “ ℕ) ↔ (𝑗 ∈ 𝐼 ∧ (𝐹‘𝑗) ∈ ℕ)))
58	54, 57	mpbid 147	. . . . . . . . . 10 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → (𝑗 ∈ 𝐼 ∧ (𝐹‘𝑗) ∈ ℕ))
59	58	simpld 112	. . . . . . . . 9 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → 𝑗 ∈ 𝐼)
60	53, 59	ffvelcdmd 5804	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ0)
61	60	nn0zd 9684	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℤ)
62		elnndc 9930	. . . . . . 7 ⊢ (((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℤ → DECID ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ)
63	61, 62	syl 14	. . . . . 6 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → DECID ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ)
64		elpreima 5788	. . . . . . . . . 10 ⊢ ((𝐹 ∘𝑓 − 𝐺) Fn 𝐼 → (𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ↔ (𝑗 ∈ 𝐼 ∧ ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ)))
65	16, 64	syl 14	. . . . . . . . 9 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ↔ (𝑗 ∈ 𝐼 ∧ ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ)))
66	65	adantr 276	. . . . . . . 8 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → (𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ↔ (𝑗 ∈ 𝐼 ∧ ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ)))
67	59, 66	mpbirand 441	. . . . . . 7 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → (𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ↔ ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ))
68	67	dcbid 846	. . . . . 6 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → (DECID 𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ↔ DECID ((𝐹 ∘𝑓 − 𝐺)‘𝑗) ∈ ℕ))
69	63, 68	mpbird 167	. . . . 5 ⊢ (((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) ∧ 𝑗 ∈ (◡𝐹 “ ℕ)) → DECID 𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ))
70	69	ralrimiva 2615	. . . 4 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ∀𝑗 ∈ (◡𝐹 “ ℕ)DECID 𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ))
71		ssfidc 7189	. . . 4 ⊢ (((◡𝐹 “ ℕ) ∈ Fin ∧ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ⊆ (◡𝐹 “ ℕ) ∧ ∀𝑗 ∈ (◡𝐹 “ ℕ)DECID 𝑗 ∈ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ)) → (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ∈ Fin)
72	42, 52, 70, 71	syl3anc 1274	. . 3 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ∈ Fin)
73	6	psrbag 14789	. . . 4 ⊢ (𝐼 ∈ V → ((𝐹 ∘𝑓 − 𝐺) ∈ 𝐷 ↔ ((𝐹 ∘𝑓 − 𝐺):𝐼⟶ℕ0 ∧ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ∈ Fin)))
74	13, 73	syl 14	. . 3 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ((𝐹 ∘𝑓 − 𝐺) ∈ 𝐷 ↔ ((𝐹 ∘𝑓 − 𝐺):𝐼⟶ℕ0 ∧ (◡(𝐹 ∘𝑓 − 𝐺) “ ℕ) ∈ Fin)))
75	37, 72, 74	mpbir2and 953	. 2 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → (𝐹 ∘𝑓 − 𝐺) ∈ 𝐷)
76	75, 50	jca 306	1 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝐺:𝐼⟶ℕ0 ∧ 𝐺 ∘𝑟 ≤ 𝐹) → ((𝐹 ∘𝑓 − 𝐺) ∈ 𝐷 ∧ (𝐹 ∘𝑓 − 𝐺) ∘𝑟 ≤ 𝐹))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  DECID wdc 842   ∧ w3a 1005   = wceq 1398   ∈ wcel 2203  ∀wral 2520  {crab 2524  Vcvv 2812   ⊆ wss 3210   class class class wbr 4102  ^◡ccnv 4739   “ cima 4743   Fn wfn 5338  ⟶wf 5339  ‘cfv 5343  (class class class)co 6041   ∘_𝑓 cof 6255   ∘_𝑟 cofr 6256   ↑_𝑚 cmap 6873  Fincfn 6966  0cc0 8115   ≤ cle 8297   − cmin 8432  ℕcn 9225  ℕ₀cn0 9484  ℤcz 9563

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4218  ax-sep 4221  ax-nul 4229  ax-pow 4279  ax-pr 4314  ax-un 4545  ax-setind 4650  ax-iinf 4701  ax-cnex 8206  ax-resscn 8207  ax-1cn 8208  ax-1re 8209  ax-icn 8210  ax-addcl 8211  ax-addrcl 8212  ax-mulcl 8213  ax-addcom 8215  ax-addass 8217  ax-distr 8219  ax-i2m1 8220  ax-0lt1 8221  ax-0id 8223  ax-rnegex 8224  ax-cnre 8226  ax-pre-ltirr 8227  ax-pre-ltwlin 8228  ax-pre-lttrn 8229  ax-pre-ltadd 8231

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3506  df-if 3617  df-pw 3667  df-sn 3688  df-pr 3689  df-op 3691  df-uni 3908  df-int 3943  df-iun 3986  df-br 4103  df-opab 4165  df-mpt 4166  df-tr 4202  df-id 4405  df-iord 4478  df-on 4480  df-suc 4483  df-iom 4704  df-xp 4746  df-rel 4747  df-cnv 4748  df-co 4749  df-dm 4750  df-rn 4751  df-res 4752  df-ima 4753  df-iota 5303  df-fun 5345  df-fn 5346  df-f 5347  df-f1 5348  df-fo 5349  df-f1o 5350  df-fv 5351  df-riota 5994  df-ov 6044  df-oprab 6045  df-mpo 6046  df-of 6257  df-ofr 6258  df-1o 6638  df-er 6758  df-map 6875  df-en 6967  df-fin 6969  df-pnf 8298  df-mnf 8299  df-xr 8300  df-ltxr 8301  df-le 8302  df-sub 8434  df-neg 8435  df-inn 9226  df-n0 9485  df-z 9564  df-uz 9840

This theorem is referenced by:  psrbagconcl  14797