Theorem bnj1321 35020

Description: Technical lemma for bnj60 35055. 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
bnj1321.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1321.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1321.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1321.4	⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))

Assertion

Ref	Expression
bnj1321	⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∃!𝑓𝜏)

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

Allowed substitution hints:   𝜏(𝑥,𝑓,𝑑)   𝐵(𝑥,𝑑)   𝐶(𝑥,𝑓,𝑑)   𝐺(𝑥)   𝑌(𝑥,𝑓,𝑑)

Proof of Theorem bnj1321

Dummy variables 𝑔 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 484	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∃𝑓𝜏)
2		simp1 1135	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑅 FrSe 𝐴)
3		bnj1321.4	. . . . . . . . 9 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
4	3	simplbi 497	. . . . . . . 8 ⊢ (𝜏 → 𝑓 ∈ 𝐶)
5	4	3ad2ant2 1133	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 ∈ 𝐶)
6		bnj1321.3	. . . . . . . . . . . . 13 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
7		nfab1 2905	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑓{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
8	6, 7	nfcxfr 2901	. . . . . . . . . . . 12 ⊢ Ⅎ𝑓𝐶
9	8	nfcri 2895	. . . . . . . . . . 11 ⊢ Ⅎ𝑓 𝑔 ∈ 𝐶
10		nfv 1912	. . . . . . . . . . 11 ⊢ Ⅎ𝑓dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
11	9, 10	nfan 1897	. . . . . . . . . 10 ⊢ Ⅎ𝑓(𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
12		eleq1w 2822	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (𝑓 ∈ 𝐶 ↔ 𝑔 ∈ 𝐶))
13		dmeq 5917	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
14	13	eqeq1d 2737	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ↔ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
15	12, 14	anbi12d 632	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))))
16	3, 15	bitrid 283	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → (𝜏 ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))))
17	11, 16	sbiev 2313	. . . . . . . . 9 ⊢ ([𝑔 / 𝑓]𝜏 ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
18	17	simplbi 497	. . . . . . . 8 ⊢ ([𝑔 / 𝑓]𝜏 → 𝑔 ∈ 𝐶)
19	18	3ad2ant3 1134	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑔 ∈ 𝐶)
20		bnj1321.1	. . . . . . . 8 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
21		bnj1321.2	. . . . . . . 8 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
22		eqid 2735	. . . . . . . 8 ⊢ (dom 𝑓 ∩ dom 𝑔) = (dom 𝑓 ∩ dom 𝑔)
23	20, 21, 6, 22	bnj1326 35019	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑓 ∈ 𝐶 ∧ 𝑔 ∈ 𝐶) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))
24	2, 5, 19, 23	syl3anc 1370	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))
25	3	simprbi 496	. . . . . . . . . 10 ⊢ (𝜏 → dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
26	25	3ad2ant2 1133	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
27	17	simprbi 496	. . . . . . . . . 10 ⊢ ([𝑔 / 𝑓]𝜏 → dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
28	27	3ad2ant3 1134	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
29	26, 28	eqtr4d 2778	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑓 = dom 𝑔)
30		bnj1322 34815	. . . . . . . . 9 ⊢ (dom 𝑓 = dom 𝑔 → (dom 𝑓 ∩ dom 𝑔) = dom 𝑓)
31	30	reseq2d 6000	. . . . . . . 8 ⊢ (dom 𝑓 = dom 𝑔 → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑓 ↾ dom 𝑓))
32	29, 31	syl 17	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑓 ↾ dom 𝑓))
33		releq 5789	. . . . . . . . 9 ⊢ (𝑧 = 𝑓 → (Rel 𝑧 ↔ Rel 𝑓))
34	20, 21, 6	bnj66 34853	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐶 → Rel 𝑧)
35	33, 34	vtoclga 3577	. . . . . . . 8 ⊢ (𝑓 ∈ 𝐶 → Rel 𝑓)
36		resdm 6046	. . . . . . . 8 ⊢ (Rel 𝑓 → (𝑓 ↾ dom 𝑓) = 𝑓)
37	5, 35, 36	3syl 18	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ dom 𝑓) = 𝑓)
38	32, 37	eqtrd 2775	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = 𝑓)
39		eqeq2 2747	. . . . . . . . . 10 ⊢ (dom 𝑓 = dom 𝑔 → ((dom 𝑓 ∩ dom 𝑔) = dom 𝑓 ↔ (dom 𝑓 ∩ dom 𝑔) = dom 𝑔))
40	30, 39	mpbid 232	. . . . . . . . 9 ⊢ (dom 𝑓 = dom 𝑔 → (dom 𝑓 ∩ dom 𝑔) = dom 𝑔)
41	40	reseq2d 6000	. . . . . . . 8 ⊢ (dom 𝑓 = dom 𝑔 → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ dom 𝑔))
42	29, 41	syl 17	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ dom 𝑔))
43	20, 21, 6	bnj66 34853	. . . . . . . 8 ⊢ (𝑔 ∈ 𝐶 → Rel 𝑔)
44		resdm 6046	. . . . . . . 8 ⊢ (Rel 𝑔 → (𝑔 ↾ dom 𝑔) = 𝑔)
45	19, 43, 44	3syl 18	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ dom 𝑔) = 𝑔)
46	42, 45	eqtrd 2775	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = 𝑔)
47	24, 38, 46	3eqtr3d 2783	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔)
48	47	3expib 1121	. . . 4 ⊢ (𝑅 FrSe 𝐴 → ((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
49	48	alrimivv 1926	. . 3 ⊢ (𝑅 FrSe 𝐴 → ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
50	49	adantr 480	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
51		nfv 1912	. . 3 ⊢ Ⅎ𝑔𝜏
52	51	eu2 2607	. 2 ⊢ (∃!𝑓𝜏 ↔ (∃𝑓𝜏 ∧ ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔)))
53	1, 50, 52	sylanbrc 583	1 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∃!𝑓𝜏)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1535   = wceq 1537  ∃wex 1776  [wsb 2062   ∈ wcel 2106  ∃!weu 2566  {cab 2712  ∀wral 3059  ∃wrex 3068   ∪ cun 3961   ∩ cin 3962   ⊆ wss 3963  {csn 4631  ⟨cop 4637  dom cdm 5689   ↾ cres 5691  Rel wrel 5694   Fn wfn 6558  ‘cfv 6563   predc-bnj14 34681   FrSe w-bnj15 34685   trClc-bnj18 34687

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-reg 9630  ax-inf2 9679

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-om 7888  df-1o 8505  df-bnj17 34680  df-bnj14 34682  df-bnj13 34684  df-bnj15 34686  df-bnj18 34688  df-bnj19 34690

This theorem is referenced by:  bnj1489  35049