Theorem bnj149 34851

Description: Technical lemma for bnj151 34853. 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 1194	. . . . . . . 8 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn 1o)
2		df1o2 8529	. . . . . . . . 9 ⊢ 1o = {∅}
3	2	fneq2i 6677	. . . . . . . 8 ⊢ (𝑓 Fn 1o ↔ 𝑓 Fn {∅})
4	1, 3	sylib 218	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn {∅})
5		simpr2 1195	. . . . . . . . . 10 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝜑′)
6		bnj149.6	. . . . . . . . . 10 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
7	5, 6	sylib 218	. . . . . . . . 9 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
8		fvex 6933	. . . . . . . . . 10 ⊢ (𝑓‘∅) ∈ V
9	8	elsn 4663	. . . . . . . . 9 ⊢ ((𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
10	7, 9	sylibr 234	. . . . . . . 8 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
11		0ex 5325	. . . . . . . . 9 ⊢ ∅ ∈ V
12		fveq2 6920	. . . . . . . . . 10 ⊢ (𝑔 = ∅ → (𝑓‘𝑔) = (𝑓‘∅))
13	12	eleq1d 2829	. . . . . . . . 9 ⊢ (𝑔 = ∅ → ((𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)}))
14	11, 13	ralsn 4705	. . . . . . . 8 ⊢ (∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
15	10, 14	sylibr 234	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)})
16		ffnfv 7153	. . . . . . 7 ⊢ (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓 Fn {∅} ∧ ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)}))
17	4, 15, 16	sylanbrc 582	. . . . . 6 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)})
18		bnj93 34839	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
19	18	adantr 480	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → pred(𝑥, 𝐴, 𝑅) ∈ V)
20		fsng 7171	. . . . . . 7 ⊢ ((∅ ∈ V ∧ pred(𝑥, 𝐴, 𝑅) ∈ V) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
21	11, 19, 20	sylancr 586	. . . . . 6 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
22	17, 21	mpbid 232	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
23	22	ex 412	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
24	23	alrimiv 1926	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
25		mo2icl 3736	. . 3 ⊢ (∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
26	24, 25	syl 17	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
27		bnj149.1	. 2 ⊢ (𝜃1 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
28	26, 27	mpbir 231	1 ⊢ 𝜃1

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1535   = wceq 1537   ∈ wcel 2108  ∃*wmo 2541  ∀wral 3067  Vcvv 3488  [wsbc 3804  ∅c0 4352  {csn 4648  ⟨cop 4654   Fn wfn 6568  ⟶wf 6569  ‘cfv 6573  1_oc1o 8515   predc-bnj14 34664   FrSe w-bnj15 34668

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-1o 8522  df-bnj13 34667  df-bnj15 34669

This theorem is referenced by:  bnj151  34853