Theorem bnj852 33622

Description: Technical lemma for bnj69 33711. 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
bnj852.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj852.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj852.3	⊢ 𝐷 = (ω ∖ {∅})

Assertion

Ref	Expression
bnj852	⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))

Distinct variable groups:   𝐴,𝑓,𝑖,𝑛,𝑦   𝐷,𝑓,𝑖,𝑛   𝑅,𝑓,𝑖,𝑛,𝑦   𝑓,𝑋,𝑛

Allowed substitution hints:   𝜑(𝑦,𝑓,𝑖,𝑛)   𝜓(𝑦,𝑓,𝑖,𝑛)   𝐷(𝑦)   𝑋(𝑦,𝑖)

Proof of Theorem bnj852

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

Step	Hyp	Ref	Expression
1		elisset 2814	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → ∃𝑥 𝑥 = 𝑋)
2	1	adantl 482	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → ∃𝑥 𝑥 = 𝑋)
3	2	ancri 550	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → (∃𝑥 𝑥 = 𝑋 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)))
4	3	bnj534 33440	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → ∃𝑥(𝑥 = 𝑋 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)))
5		eleq1 2820	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐴 ↔ 𝑋 ∈ 𝐴))
6	5	anbi2d 629	. . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)))
7	6	biimpar 478	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)) → (𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴))
8		biid 260	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐷 (𝑧 E 𝑛 → [𝑧 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))) ↔ ∀𝑧 ∈ 𝐷 (𝑧 E 𝑛 → [𝑧 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))))
9		bnj852.3	. . . . . . . . 9 ⊢ 𝐷 = (ω ∖ {∅})
10		omex 9588	. . . . . . . . . 10 ⊢ ω ∈ V
11		difexg 5289	. . . . . . . . . 10 ⊢ (ω ∈ V → (ω ∖ {∅}) ∈ V)
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ (ω ∖ {∅}) ∈ V
13	9, 12	eqeltri 2828	. . . . . . . 8 ⊢ 𝐷 ∈ V
14		zfregfr 9550	. . . . . . . 8 ⊢ E Fr 𝐷
15	8, 13, 14	bnj157 33560	. . . . . . 7 ⊢ (∀𝑛 ∈ 𝐷 (∀𝑧 ∈ 𝐷 (𝑧 E 𝑛 → [𝑧 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))) → ∀𝑛 ∈ 𝐷 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)))
16		biid 260	. . . . . . . . . 10 ⊢ ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
17		bnj852.2	. . . . . . . . . 10 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
18		biid 260	. . . . . . . . . 10 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)))
19	16, 17, 9, 18, 8	bnj153 33581	. . . . . . . . 9 ⊢ (𝑛 = 1o → ((𝑛 ∈ 𝐷 ∧ ∀𝑧 ∈ 𝐷 (𝑧 E 𝑛 → [𝑧 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)))) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))))
20	16, 17, 9, 18, 8	bnj601 33621	. . . . . . . . 9 ⊢ (𝑛 ≠ 1o → ((𝑛 ∈ 𝐷 ∧ ∀𝑧 ∈ 𝐷 (𝑧 E 𝑛 → [𝑧 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)))) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))))
21	19, 20	pm2.61ine 3024	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝐷 ∧ ∀𝑧 ∈ 𝐷 (𝑧 E 𝑛 → [𝑧 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)))) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)))
22	21	ex 413	. . . . . . 7 ⊢ (𝑛 ∈ 𝐷 → (∀𝑧 ∈ 𝐷 (𝑧 E 𝑛 → [𝑧 / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))) → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))))
23	15, 22	mprg 3066	. . . . . 6 ⊢ ∀𝑛 ∈ 𝐷 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))
24		r19.21v 3172	. . . . . 6 ⊢ (∀𝑛 ∈ 𝐷 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓)))
25	23, 24	mpbi 229	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))
26	7, 25	syl 17	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)) → ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓))
27		bnj602 33616	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → pred(𝑥, 𝐴, 𝑅) = pred(𝑋, 𝐴, 𝑅))
28	27	eqeq2d 2742	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)))
29		bnj852.1	. . . . . . . . 9 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
30	28, 29	bitr4di 288	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ 𝜑))
31	30	3anbi2d 1441	. . . . . . 7 ⊢ (𝑥 = 𝑋 → ((𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓) ↔ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
32	31	eubidv 2579	. . . . . 6 ⊢ (𝑥 = 𝑋 → (∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓) ↔ ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
33	32	ralbidv 3170	. . . . 5 ⊢ (𝑥 = 𝑋 → (∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓) ↔ ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
34	33	adantr 481	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)) → (∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓) ↔ ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
35	26, 34	mpbid 231	. . 3 ⊢ ((𝑥 = 𝑋 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)) → ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
36	4, 35	bnj593 33446	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → ∃𝑥∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
37	36	bnj937 33472	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → ∀𝑛 ∈ 𝐷 ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∃!weu 2561  ∀wral 3060  Vcvv 3446  [wsbc 3742   ∖ cdif 3910  ∅c0 4287  {csn 4591  ∪ ciun 4959   class class class wbr 5110   E cep 5541  suc csuc 6324   Fn wfn 6496  ‘cfv 6501  ωcom 7807  1_oc1o 8410   predc-bnj14 33389   FrSe w-bnj15 33393

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5247  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677  ax-reg 9537  ax-inf2 9586

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-tr 5228  df-id 5536  df-eprel 5542  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ord 6325  df-on 6326  df-lim 6327  df-suc 6328  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-om 7808  df-1o 8417  df-bnj17 33388  df-bnj14 33390  df-bnj13 33392  df-bnj15 33394

This theorem is referenced by:  bnj864  33623  bnj865  33624  bnj906  33631