Theorem bnj149 35229

Description: Technical lemma for bnj151 35231. 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.) (Proof shortened by Mario Carneiro, 22-Dec-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj149.1	⊢ (𝜃1 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
bnj149.2	⊢ (𝜁0 ↔ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
bnj149.3	⊢ (𝜁1 ↔ [𝑔 / 𝑓]𝜁0)
bnj149.4	⊢ (𝜑1 ↔ [𝑔 / 𝑓]𝜑′)
bnj149.5	⊢ (𝜓1 ↔ [𝑔 / 𝑓]𝜓′)
bnj149.6	⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))

Assertion

Ref	Expression
bnj149	⊢ 𝜃1

Distinct variable groups:   𝐴,𝑓,𝑔,𝑥   𝑅,𝑓,𝑔,𝑥   𝑓,𝜁₁   𝑔,𝜁₀

Allowed substitution hints:   𝜑′(𝑥,𝑓,𝑔)   𝜓′(𝑥,𝑓,𝑔)   𝜁₀(𝑥,𝑓)   𝜑₁(𝑥,𝑓,𝑔)   𝜓₁(𝑥,𝑓,𝑔)   𝜃₁(𝑥,𝑓,𝑔)   𝜁₁(𝑥,𝑔)

Proof of Theorem bnj149

Step	Hyp	Ref	Expression
1		simpr1 1211	. . . . . . . 8 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn 1o)
2		df1o2 8459	. . . . . . . . 9 ⊢ 1o = {∅}
3	2	fneq2i 6633	. . . . . . . 8 ⊢ (𝑓 Fn 1o ↔ 𝑓 Fn {∅})
4	1, 3	sylib 221	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn {∅})
5		simpr2 1212	. . . . . . . . . 10 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝜑′)
6		bnj149.6	. . . . . . . . . 10 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
7	5, 6	sylib 221	. . . . . . . . 9 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
8		fvex 6894	. . . . . . . . . 10 ⊢ (𝑓‘∅) ∈ V
9	8	elsn 4603	. . . . . . . . 9 ⊢ ((𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
10	7, 9	sylibr 237	. . . . . . . 8 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
11		0ex 5269	. . . . . . . . 9 ⊢ ∅ ∈ V
12		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑔 = ∅ → (𝑓‘𝑔) = (𝑓‘∅))
13	12	eleq1d 2846	. . . . . . . . 9 ⊢ (𝑔 = ∅ → ((𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)}))
14	11, 13	ralsn 4646	. . . . . . . 8 ⊢ (∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
15	10, 14	sylibr 237	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)})
16		ffnfv 7114	. . . . . . 7 ⊢ (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓 Fn {∅} ∧ ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)}))
17	4, 15, 16	sylanbrc 594	. . . . . 6 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)})
18		bnj93 35217	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
19	18	adantr 485	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → pred(𝑥, 𝐴, 𝑅) ∈ V)
20		fsng 7133	. . . . . . 7 ⊢ ((∅ ∈ V ∧ pred(𝑥, 𝐴, 𝑅) ∈ V) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
21	11, 19, 20	sylancr 598	. . . . . 6 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
22	17, 21	mpbid 235	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
23	22	ex 417	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
24	23	alrimiv 1955	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
25		mo2icl 3676	. . 3 ⊢ (∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
26	24, 25	syl 18	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
27		bnj149.1	. 2 ⊢ (𝜃1 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
28	26, 27	mpbir 234	1 ⊢ 𝜃1

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101  ∀wal 1566   = wceq 1568   ∈ wcel 2141  ∃*wmo 2563  ∀wral 3077  Vcvv 3453  [wsbc 3743  ∅c0 4285  {csn 4588  ⟨cop 4594   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536  1_oc1o 8445   predc-bnj14 35043   FrSe w-bnj15 35047

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-1o 8452  df-bnj13 35046  df-bnj15 35048

This theorem is referenced by:  bnj151  35231