Theorem bnj1326 35446

Description: Technical lemma for bnj60 35482. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1326.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1326.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1326.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1326.4	⊢ 𝐷 = (dom 𝑔 ∩ dom ℎ)

Assertion

Ref	Expression
bnj1326	⊢ ((𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶) → (𝑔 ↾ 𝐷) = (ℎ ↾ 𝐷))

Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝐵,𝑓   𝐺,𝑑,𝑓   𝑅,𝑑,𝑓,𝑥

Allowed substitution hints:   𝐴(𝑔, ℎ)   𝐵(𝑥, 𝑔, ℎ, 𝑑)   𝐶(𝑥, 𝑓, 𝑔, ℎ, 𝑑)   𝐷(𝑥, 𝑓, 𝑔, ℎ, 𝑑)   𝑅(𝑔, ℎ)   𝐺(𝑥, 𝑔, ℎ)   𝑌(𝑥, 𝑓, 𝑔, ℎ, 𝑑)

Proof of Theorem bnj1326

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

Step	Hyp	Ref	Expression
1		eleq1w 2849	. . . 4 ⊢ (𝑞 = ℎ → (𝑞 ∈ 𝐶 ↔ ℎ ∈ 𝐶))
2	1	3anbi3d 1470	. . 3 ⊢ (𝑞 = ℎ → ((𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶) ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶)))
3		dmeq 5898	. . . . . . 7 ⊢ (𝑞 = ℎ → dom 𝑞 = dom ℎ)
4	3	ineq2d 4176	. . . . . 6 ⊢ (𝑞 = ℎ → (dom 𝑔 ∩ dom 𝑞) = (dom 𝑔 ∩ dom ℎ))
5	4	reseq2d 5983	. . . . 5 ⊢ (𝑞 = ℎ → (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑔 ↾ (dom 𝑔 ∩ dom ℎ)))
6		bnj1326.4	. . . . . 6 ⊢ 𝐷 = (dom 𝑔 ∩ dom ℎ)
7	6	reseq2i 5980	. . . . 5 ⊢ (𝑔 ↾ 𝐷) = (𝑔 ↾ (dom 𝑔 ∩ dom ℎ))
8	5, 7	eqtr4di 2819	. . . 4 ⊢ (𝑞 = ℎ → (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑔 ↾ 𝐷))
9	4	reseq2d 5983	. . . . . 6 ⊢ (𝑞 = ℎ → (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑔 ∩ dom ℎ)))
10		reseq1 5977	. . . . . 6 ⊢ (𝑞 = ℎ → (𝑞 ↾ (dom 𝑔 ∩ dom ℎ)) = (ℎ ↾ (dom 𝑔 ∩ dom ℎ)))
11	9, 10	eqtrd 2801	. . . . 5 ⊢ (𝑞 = ℎ → (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞)) = (ℎ ↾ (dom 𝑔 ∩ dom ℎ)))
12	6	reseq2i 5980	. . . . 5 ⊢ (ℎ ↾ 𝐷) = (ℎ ↾ (dom 𝑔 ∩ dom ℎ))
13	11, 12	eqtr4di 2819	. . . 4 ⊢ (𝑞 = ℎ → (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞)) = (ℎ ↾ 𝐷))
14	8, 13	eqeq12d 2782	. . 3 ⊢ (𝑞 = ℎ → ((𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞)) ↔ (𝑔 ↾ 𝐷) = (ℎ ↾ 𝐷)))
15	2, 14	imbi12d 347	. 2 ⊢ (𝑞 = ℎ → (((𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶) → (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞))) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶) → (𝑔 ↾ 𝐷) = (ℎ ↾ 𝐷))))
16		eleq1w 2849	. . . . 5 ⊢ (𝑝 = 𝑔 → (𝑝 ∈ 𝐶 ↔ 𝑔 ∈ 𝐶))
17	16	3anbi2d 1469	. . . 4 ⊢ (𝑝 = 𝑔 → ((𝑅 FrSe 𝐴 ∧ 𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶) ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶)))
18		dmeq 5898	. . . . . . . 8 ⊢ (𝑝 = 𝑔 → dom 𝑝 = dom 𝑔)
19	18	ineq1d 4175	. . . . . . 7 ⊢ (𝑝 = 𝑔 → (dom 𝑝 ∩ dom 𝑞) = (dom 𝑔 ∩ dom 𝑞))
20	19	reseq2d 5983	. . . . . 6 ⊢ (𝑝 = 𝑔 → (𝑝 ↾ (dom 𝑝 ∩ dom 𝑞)) = (𝑝 ↾ (dom 𝑔 ∩ dom 𝑞)))
21		reseq1 5977	. . . . . 6 ⊢ (𝑝 = 𝑔 → (𝑝 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)))
22	20, 21	eqtrd 2801	. . . . 5 ⊢ (𝑝 = 𝑔 → (𝑝 ↾ (dom 𝑝 ∩ dom 𝑞)) = (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)))
23	19	reseq2d 5983	. . . . 5 ⊢ (𝑝 = 𝑔 → (𝑞 ↾ (dom 𝑝 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞)))
24	22, 23	eqeq12d 2782	. . . 4 ⊢ (𝑝 = 𝑔 → ((𝑝 ↾ (dom 𝑝 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑝 ∩ dom 𝑞)) ↔ (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞))))
25	17, 24	imbi12d 347	. . 3 ⊢ (𝑝 = 𝑔 → (((𝑅 FrSe 𝐴 ∧ 𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶) → (𝑝 ↾ (dom 𝑝 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑝 ∩ dom 𝑞))) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶) → (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞)))))
26		bnj1326.1	. . . 4 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
27		bnj1326.2	. . . 4 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
28		bnj1326.3	. . . 4 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
29		eqid 2766	. . . 4 ⊢ (dom 𝑝 ∩ dom 𝑞) = (dom 𝑝 ∩ dom 𝑞)
30	26, 27, 28, 29	bnj1311 35444	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶) → (𝑝 ↾ (dom 𝑝 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑝 ∩ dom 𝑞)))
31	25, 30	chvarvv 2022	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ 𝑞 ∈ 𝐶) → (𝑔 ↾ (dom 𝑔 ∩ dom 𝑞)) = (𝑞 ↾ (dom 𝑔 ∩ dom 𝑞)))
32	15, 31	chvarvv 2022	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶) → (𝑔 ↾ 𝐷) = (ℎ ↾ 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  {cab 2744  ∀wral 3082  ∃wrex 3092   ∩ cin 3907   ⊆ wss 3908  ⟨cop 4600  dom cdm 5666   ↾ cres 5668   Fn wfn 6538  ‘cfv 6543   predc-bnj14 35109   FrSe w-bnj15 35113

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-reg 9564  ax-inf2 9620

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-om 7872  df-1o 8462  df-bnj17 35108  df-bnj14 35110  df-bnj13 35112  df-bnj15 35114  df-bnj18 35116  df-bnj19 35118

This theorem is used by:  bnj1321  35447  bnj1384  35452