Theorem bnj149 35012

Description: Technical lemma for bnj151 35014. 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 1196	. . . . . . . 8 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn 1o)
2		df1o2 8406	. . . . . . . . 9 ⊢ 1o = {∅}
3	2	fneq2i 6591	. . . . . . . 8 ⊢ (𝑓 Fn 1o ↔ 𝑓 Fn {∅})
4	1, 3	sylib 218	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn {∅})
5		simpr2 1197	. . . . . . . . . 10 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝜑′)
6		bnj149.6	. . . . . . . . . 10 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
7	5, 6	sylib 218	. . . . . . . . 9 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
8		fvex 6848	. . . . . . . . . 10 ⊢ (𝑓‘∅) ∈ V
9	8	elsn 4596	. . . . . . . . 9 ⊢ ((𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
10	7, 9	sylibr 234	. . . . . . . 8 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
11		0ex 5253	. . . . . . . . 9 ⊢ ∅ ∈ V
12		fveq2 6835	. . . . . . . . . 10 ⊢ (𝑔 = ∅ → (𝑓‘𝑔) = (𝑓‘∅))
13	12	eleq1d 2822	. . . . . . . . 9 ⊢ (𝑔 = ∅ → ((𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)}))
14	11, 13	ralsn 4639	. . . . . . . 8 ⊢ (∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
15	10, 14	sylibr 234	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)})
16		ffnfv 7066	. . . . . . 7 ⊢ (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓 Fn {∅} ∧ ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)}))
17	4, 15, 16	sylanbrc 584	. . . . . 6 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)})
18		bnj93 35000	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
19	18	adantr 480	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → pred(𝑥, 𝐴, 𝑅) ∈ V)
20		fsng 7084	. . . . . . 7 ⊢ ((∅ ∈ V ∧ pred(𝑥, 𝐴, 𝑅) ∈ V) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
21	11, 19, 20	sylancr 588	. . . . . 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 1929	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
25		mo2icl 3673	. . 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 1540   = wceq 1542   ∈ wcel 2114  ∃*wmo 2538  ∀wral 3052  Vcvv 3441  [wsbc 3741  ∅c0 4286  {csn 4581  ⟨cop 4587   Fn wfn 6488  ⟶wf 6489  ‘cfv 6493  1_oc1o 8392   predc-bnj14 34825   FrSe w-bnj15 34829

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-1o 8399  df-bnj13 34828  df-bnj15 34830

This theorem is referenced by:  bnj151  35014