Theorem bnj1321 31095

Description: Technical lemma for bnj60 31130. 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 477	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∃𝑓𝜏)
2		simp1 1061	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑅 FrSe 𝐴)
3		bnj1321.4	. . . . . . . . 9 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
4	3	simplbi 476	. . . . . . . 8 ⊢ (𝜏 → 𝑓 ∈ 𝐶)
5	4	3ad2ant2 1083	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 ∈ 𝐶)
6		bnj1321.3	. . . . . . . . . . . . 13 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
7		nfab1 2766	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑓{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
8	6, 7	nfcxfr 2762	. . . . . . . . . . . 12 ⊢ Ⅎ𝑓𝐶
9	8	nfcri 2758	. . . . . . . . . . 11 ⊢ Ⅎ𝑓 𝑔 ∈ 𝐶
10		nfv 1843	. . . . . . . . . . 11 ⊢ Ⅎ𝑓dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
11	9, 10	nfan 1828	. . . . . . . . . 10 ⊢ Ⅎ𝑓(𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
12		eleq1 2689	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (𝑓 ∈ 𝐶 ↔ 𝑔 ∈ 𝐶))
13		dmeq 5324	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
14	13	eqeq1d 2624	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ↔ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
15	12, 14	anbi12d 747	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))))
16	3, 15	syl5bb 272	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → (𝜏 ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))))
17	11, 16	sbie 2408	. . . . . . . . 9 ⊢ ([𝑔 / 𝑓]𝜏 ↔ (𝑔 ∈ 𝐶 ∧ dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
18	17	simplbi 476	. . . . . . . 8 ⊢ ([𝑔 / 𝑓]𝜏 → 𝑔 ∈ 𝐶)
19	18	3ad2ant3 1084	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑔 ∈ 𝐶)
20		bnj1321.1	. . . . . . . 8 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
21		bnj1321.2	. . . . . . . 8 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
22		eqid 2622	. . . . . . . 8 ⊢ (dom 𝑓 ∩ dom 𝑔) = (dom 𝑓 ∩ dom 𝑔)
23	20, 21, 6, 22	bnj1326 31094	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑓 ∈ 𝐶 ∧ 𝑔 ∈ 𝐶) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))
24	2, 5, 19, 23	syl3anc 1326	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))
25	3	simprbi 480	. . . . . . . . . 10 ⊢ (𝜏 → dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
26	25	3ad2ant2 1083	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
27	17	simprbi 480	. . . . . . . . . 10 ⊢ ([𝑔 / 𝑓]𝜏 → dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
28	27	3ad2ant3 1084	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑔 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
29	26, 28	eqtr4d 2659	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → dom 𝑓 = dom 𝑔)
30		bnj1322 30893	. . . . . . . . 9 ⊢ (dom 𝑓 = dom 𝑔 → (dom 𝑓 ∩ dom 𝑔) = dom 𝑓)
31	30	reseq2d 5396	. . . . . . . 8 ⊢ (dom 𝑓 = dom 𝑔 → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑓 ↾ dom 𝑓))
32	29, 31	syl 17	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑓 ↾ dom 𝑓))
33		releq 5201	. . . . . . . . 9 ⊢ (𝑧 = 𝑓 → (Rel 𝑧 ↔ Rel 𝑓))
34	20, 21, 6	bnj66 30930	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐶 → Rel 𝑧)
35	33, 34	vtoclga 3272	. . . . . . . 8 ⊢ (𝑓 ∈ 𝐶 → Rel 𝑓)
36		resdm 5441	. . . . . . . 8 ⊢ (Rel 𝑓 → (𝑓 ↾ dom 𝑓) = 𝑓)
37	5, 35, 36	3syl 18	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ dom 𝑓) = 𝑓)
38	32, 37	eqtrd 2656	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = 𝑓)
39		eqeq2 2633	. . . . . . . . . 10 ⊢ (dom 𝑓 = dom 𝑔 → ((dom 𝑓 ∩ dom 𝑔) = dom 𝑓 ↔ (dom 𝑓 ∩ dom 𝑔) = dom 𝑔))
40	30, 39	mpbid 222	. . . . . . . . 9 ⊢ (dom 𝑓 = dom 𝑔 → (dom 𝑓 ∩ dom 𝑔) = dom 𝑔)
41	40	reseq2d 5396	. . . . . . . 8 ⊢ (dom 𝑓 = dom 𝑔 → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ dom 𝑔))
42	29, 41	syl 17	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ dom 𝑔))
43	20, 21, 6	bnj66 30930	. . . . . . . 8 ⊢ (𝑔 ∈ 𝐶 → Rel 𝑔)
44		resdm 5441	. . . . . . . 8 ⊢ (Rel 𝑔 → (𝑔 ↾ dom 𝑔) = 𝑔)
45	19, 43, 44	3syl 18	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ dom 𝑔) = 𝑔)
46	42, 45	eqtrd 2656	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)) = 𝑔)
47	24, 38, 46	3eqtr3d 2664	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔)
48	47	3expib 1268	. . . 4 ⊢ (𝑅 FrSe 𝐴 → ((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
49	48	alrimivv 1856	. . 3 ⊢ (𝑅 FrSe 𝐴 → ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
50	49	adantr 481	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔))
51		nfv 1843	. . 3 ⊢ Ⅎ𝑔𝜏
52	51	eu2 2509	. 2 ⊢ (∃!𝑓𝜏 ↔ (∃𝑓𝜏 ∧ ∀𝑓∀𝑔((𝜏 ∧ [𝑔 / 𝑓]𝜏) → 𝑓 = 𝑔)))
53	1, 50, 52	sylanbrc 698	1 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏) → ∃!𝑓𝜏)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1037  ∀wal 1481   = wceq 1483  ∃wex 1704  [wsb 1880   ∈ wcel 1990  ∃!weu 2470  {cab 2608  ∀wral 2912  ∃wrex 2913   ∪ cun 3572   ∩ cin 3573   ⊆ wss 3574  {csn 4177  ⟨cop 4183  dom cdm 5114   ↾ cres 5116  Rel wrel 5119   Fn wfn 5883  ‘cfv 5888   predc-bnj14 30754   FrSe w-bnj15 30758   trClc-bnj18 30760

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-reg 8497  ax-inf2 8538

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-1o 7560  df-bnj17 30753  df-bnj14 30755  df-bnj13 30757  df-bnj15 30759  df-bnj18 30761  df-bnj19 30763

This theorem is referenced by:  bnj1489  31124