Theorem bnj150 35372

Description: Technical lemma for bnj151 35373. 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
bnj150.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj150.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj150.3	⊢ (𝜁 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
bnj150.4	⊢ (𝜑′ ↔ [1o / 𝑛]𝜑)
bnj150.5	⊢ (𝜓′ ↔ [1o / 𝑛]𝜓)
bnj150.6	⊢ (𝜃0 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
bnj150.7	⊢ (𝜁′ ↔ [1o / 𝑛]𝜁)
bnj150.8	⊢ 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
bnj150.9	⊢ (𝜑″ ↔ [𝐹 / 𝑓]𝜑′)
bnj150.10	⊢ (𝜓″ ↔ [𝐹 / 𝑓]𝜓′)
bnj150.11	⊢ (𝜁″ ↔ [𝐹 / 𝑓]𝜁′)

Assertion

Ref	Expression
bnj150	⊢ 𝜃0

Distinct variable groups:   𝐴,𝑓,𝑛,𝑥   𝑓,𝐹,𝑖,𝑦   𝑅,𝑓,𝑛,𝑥   𝑖,𝑛,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜓(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜁(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝐴(𝑦, 𝑖)   𝑅(𝑦, 𝑖)   𝐹(𝑥, 𝑛)   𝜑′(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜓′(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜁′(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜑″(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜓″(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜁″(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜃₀(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)

Proof of Theorem bnj150

Step	Hyp	Ref	Expression
1		bnj150.8	. . . 4 ⊢ 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
2	1	bnj95 35360	. . 3 ⊢ 𝐹 ∈ V
3		sbceq1a 3753	. . . 4 ⊢ (𝑓 = 𝐹 → (𝜁′ ↔ [𝐹 / 𝑓]𝜁′))
4		bnj150.11	. . . 4 ⊢ (𝜁″ ↔ [𝐹 / 𝑓]𝜁′)
5	3, 4	bitr4di 292	. . 3 ⊢ (𝑓 = 𝐹 → (𝜁′ ↔ 𝜁″))
6		0ex 5268	. . . . . . . . 9 ⊢ ∅ ∈ V
7		bnj93 35359	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
8		funsng 6588	. . . . . . . . 9 ⊢ ((∅ ∈ V ∧ pred(𝑥, 𝐴, 𝑅) ∈ V) → Fun {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
9	6, 7, 8	sylancr 599	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → Fun {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
10	1	funeqi 6558	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ Fun {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
11	9, 10	sylibr 237	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → Fun 𝐹)
12	1	bnj96 35361	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom 𝐹 = 1o)
13	11, 12	bnj1422 35333	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝐹 Fn 1o)
14	1	bnj97 35362	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅))
15		bnj150.1	. . . . . . . 8 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
16		bnj150.4	. . . . . . . 8 ⊢ (𝜑′ ↔ [1o / 𝑛]𝜑)
17		bnj150.9	. . . . . . . 8 ⊢ (𝜑″ ↔ [𝐹 / 𝑓]𝜑′)
18	15, 16, 17, 1	bnj125 35368	. . . . . . 7 ⊢ (𝜑″ ↔ (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅))
19	14, 18	sylibr 237	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝜑″)
20	13, 19	jca 521	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″))
21		bnj98 35363	. . . . . 6 ⊢ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))
22		bnj150.2	. . . . . . 7 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
23		bnj150.5	. . . . . . 7 ⊢ (𝜓′ ↔ [1o / 𝑛]𝜓)
24		bnj150.10	. . . . . . 7 ⊢ (𝜓″ ↔ [𝐹 / 𝑓]𝜓′)
25	22, 23, 24, 1	bnj126 35369	. . . . . 6 ⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
26	21, 25	mpbir 234	. . . . 5 ⊢ 𝜓″
27		df-3an 1105	. . . . 5 ⊢ ((𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″) ↔ ((𝐹 Fn 1o ∧ 𝜑″) ∧ 𝜓″))
28	20, 26, 27	sylanblrc 602	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″))
29		bnj150.3	. . . . . 6 ⊢ (𝜁 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
30		bnj150.7	. . . . . 6 ⊢ (𝜁′ ↔ [1o / 𝑛]𝜁)
31	29, 30, 16, 23	bnj121 35366	. . . . 5 ⊢ (𝜁′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
32	1, 17, 24, 4, 31	bnj124 35367	. . . 4 ⊢ (𝜁″ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))
33	28, 32	mpbir 234	. . 3 ⊢ 𝜁″
34	2, 5, 33	ceqsexv2d 3502	. 2 ⊢ ∃𝑓𝜁′
35		bnj150.6	. . . 4 ⊢ (𝜃0 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
36		19.37v 2030	. . . 4 ⊢ (∃𝑓((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
37	35, 36	bitr4i 281	. . 3 ⊢ (𝜃0 ↔ ∃𝑓((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
38	37, 31	bnj133 35224	. 2 ⊢ (𝜃0 ↔ ∃𝑓𝜁′)
39	34, 38	mpbir 234	1 ⊢ 𝜃0

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3078  Vcvv 3453  [wsbc 3742  ∅c0 4282  {csn 4587  ⟨cop 4593  ∪ ciun 4954  suc csuc 6363  Fun wfun 6531   Fn wfn 6532  ‘cfv 6537  ωcom 7865  1_oc1o 8451   predc-bnj14 35185   FrSe w-bnj15 35189

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-1o 8458  df-bnj13 35188  df-bnj15 35190

This theorem is used by:  bnj151  35373