Theorem bnj1321 35724

Description: Technical lemma for bnj60 35759. 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 490	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∃𝑓𝜏)
2		simp1 1154	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑅 FrSe 𝐴)
3		bnj1321.4	. . . . . . . . 9 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
4	3	simplbi 502	. . . . . . . 8 ⊢ (𝜏 → 𝑓 ∈ 𝐶)
5	4	3ad2ant2 1152	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 ∈ 𝐶)
6		bnj1321.3	. . . . . . . . . . . . 13 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
7		nfab1 2928	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑓{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
8	6, 7	nfcxfr 2924	. . . . . . . . . . . 12 ⊢ Ⅎ𝑓𝐶
9	8	nfcri 2918	. . . . . . . . . . 11 ⊢ Ⅎ𝑓 𝑔 ∈ 𝐶
10		nfv 1949	. . . . . . . . . . 11 ⊢ Ⅎ𝑓dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
11	9, 10	nfan 1934	. . . . . . . . . 10 ⊢ Ⅎ𝑓(𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
12		eleq1w 2847	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (𝑓 ∈ 𝐶 ↔ 𝑔 ∈ 𝐶))
13		dmeq 5891	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
14	13	eqeq1d 2765	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ↔ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
15	12, 14	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))))
16	3, 15	bitrid 286	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → (𝜏 ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))))
17	11, 16	sbiev 2349	. . . . . . . . 9 ⊢ ([𝑔 / 𝑓]𝜏 ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
18	17	simplbi 502	. . . . . . . 8 ⊢ ([𝑔 / 𝑓]𝜏 → 𝑔 ∈ 𝐶)
19	18	3ad2ant3 1153	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑔 ∈ 𝐶)
20		bnj1321.1	. . . . . . . 8 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
21		bnj1321.2	. . . . . . . 8 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
22		eqid 2763	. . . . . . . 8 ⊢ (dom 𝑓 ∩ dom 𝑔) = (dom 𝑓 ∩ dom 𝑔)
23	20, 21, 6, 22	bnj1326 35723	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑓 ∈ 𝐶 ∧ 𝑔 ∈ 𝐶) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))
24	2, 5, 19, 23	syl3anc 1399	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))
25	3	simprbi 503	. . . . . . . . . 10 ⊢ (𝜏 → dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
26	25	3ad2ant2 1152	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
27	17	simprbi 503	. . . . . . . . . 10 ⊢ ([𝑔 / 𝑓]𝜏 → dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
28	27	3ad2ant3 1153	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
29	26, 28	eqtr4d 2801	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑓 = dom 𝑔)
30		bnj1322 35519	. . . . . . . . 9 ⊢ (dom 𝑓 = dom 𝑔 → (dom 𝑓 ∩ dom 𝑔) = dom 𝑓)
31	30	reseq2d 5980	. . . . . . . 8 ⊢ (dom 𝑓 = dom 𝑔 → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑓 ↾ dom 𝑓))
32	29, 31	syl 18	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑓 ↾ dom 𝑓))
33		releq 5758	. . . . . . . . 9 ⊢ (𝑧 = 𝑓 → (Rel 𝑧 ↔ Rel 𝑓))
34	20, 21, 6	bnj66 35557	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐶 → Rel 𝑧)
35	33, 34	vtoclga 3540	. . . . . . . 8 ⊢ (𝑓 ∈ 𝐶 → Rel 𝑓)
36		resdm 6026	. . . . . . . 8 ⊢ (Rel 𝑓 → (𝑓 ↾ dom 𝑓) = 𝑓)
37	5, 35, 36	3syl 19	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ dom 𝑓) = 𝑓)
38	32, 37	eqtrd 2798	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = 𝑓)
39		eqeq2 2775	. . . . . . . . . 10 ⊢ (dom 𝑓 = dom 𝑔 → ((dom 𝑓 ∩ dom 𝑔) = dom 𝑓 ↔ (dom 𝑓 ∩ dom 𝑔) = dom 𝑔))
40	30, 39	mpbid 235	. . . . . . . . 9 ⊢ (dom 𝑓 = dom 𝑔 → (dom 𝑓 ∩ dom 𝑔) = dom 𝑔)
41	40	reseq2d 5980	. . . . . . . 8 ⊢ (dom 𝑓 = dom 𝑔 → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ dom 𝑔))
42	29, 41	syl 18	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ dom 𝑔))
43	20, 21, 6	bnj66 35557	. . . . . . . 8 ⊢ (𝑔 ∈ 𝐶 → Rel 𝑔)
44		resdm 6026	. . . . . . . 8 ⊢ (Rel 𝑔 → (𝑔 ↾ dom 𝑔) = 𝑔)
45	19, 43, 44	3syl 19	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ dom 𝑔) = 𝑔)
46	42, 45	eqtrd 2798	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = 𝑔)
47	24, 38, 46	3eqtr3d 2806	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔)
48	47	3expib 1140	. . . 4 ⊢ (𝑅 FrSe 𝐴 → ((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
49	48	alrimivv 1963	. . 3 ⊢ (𝑅 FrSe 𝐴 → ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
50	49	adantr 486	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
51		nfv 1949	. . 3 ⊢ Ⅎ𝑔𝜏
52	51	eu2 2637	. 2 ⊢ (∃!𝑓𝜏 ↔ (∃𝑓𝜏 ∧ ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔)))
53	1, 50, 52	sylanbrc 595	1 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∃!𝑓𝜏)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812  [wsb 2101   ∈ wcel 2147  ∃!weu 2596  {cab 2741  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092   ∪ cun 4152  {csn 4588  ⟨cop 4838  dom cdm 5655   ↾ cres 5657  Rel wrel 5660   Fn wfn 6550  ‘cfv 6555   predc-bnj14 35386   FrSe w-bnj15 35390   trClc-bnj18 35392

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-reg 9610  ax-inf2 9666

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-om 7899  df-1o 8501  df-bnj17 35385  df-bnj14 35387  df-bnj13 35389  df-bnj15 35391  df-bnj18 35393  df-bnj19 35395

This theorem is used by:  bnj1489  35753