Theorem bnj124 35435

Description: Technical lemma for bnj150 35440. 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
bnj124.1	⊢ 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
bnj124.2	⊢ (𝜑″ ↔ [𝐹 / 𝑓]𝜑′)
bnj124.3	⊢ (𝜓″ ↔ [𝐹 / 𝑓]𝜓′)
bnj124.4	⊢ (𝜁″ ↔ [𝐹 / 𝑓]𝜁′)
bnj124.5	⊢ (𝜁′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))

Assertion

Ref	Expression
bnj124	⊢ (𝜁″ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))

Distinct variable groups:   𝐴,𝑓   𝑅,𝑓   𝑥,𝑓

Allowed substitution hints:   𝐴(𝑥)   𝑅(𝑥)   𝐹(𝑥, 𝑓)   𝜑′(𝑥, 𝑓)   𝜓′(𝑥, 𝑓)   𝜁′(𝑥, 𝑓)   𝜑″(𝑥, 𝑓)   𝜓″(𝑥, 𝑓)   𝜁″(𝑥, 𝑓)

Proof of Theorem bnj124

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj124.4	. 2 ⊢ (𝜁″ ↔ [𝐹 / 𝑓]𝜁′)
2		bnj124.5	. . . 4 ⊢ (𝜁′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
3	2	sbcbii 3794	. . 3 ⊢ ([𝐹 / 𝑓]𝜁′ ↔ [𝐹 / 𝑓]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
4		bnj124.1	. . . . 5 ⊢ 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
5	4	bnj95 35428	. . . 4 ⊢ 𝐹 ∈ V
6		nfv 1947	. . . . 5 ⊢ Ⅎ𝑓(𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴)
7	6	sbc19.21g 3809	. . . 4 ⊢ (𝐹 ∈ V → ([𝐹 / 𝑓]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))))
8	5, 7	ax-mp 5	. . 3 ⊢ ([𝐹 / 𝑓]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
9		fneq1 6618	. . . . . . . 8 ⊢ (𝑓 = 𝑧 → (𝑓 Fn 1o ↔ 𝑧 Fn 1o))
10		fneq1 6618	. . . . . . . 8 ⊢ (𝑧 = 𝐹 → (𝑧 Fn 1o ↔ 𝐹 Fn 1o))
11	9, 10	sbcie2g 3778	. . . . . . 7 ⊢ (𝐹 ∈ V → ([𝐹 / 𝑓]𝑓 Fn 1o ↔ 𝐹 Fn 1o))
12	5, 11	ax-mp 5	. . . . . 6 ⊢ ([𝐹 / 𝑓]𝑓 Fn 1o ↔ 𝐹 Fn 1o)
13	12	bicomi 227	. . . . 5 ⊢ (𝐹 Fn 1o ↔ [𝐹 / 𝑓]𝑓 Fn 1o)
14		bnj124.2	. . . . 5 ⊢ (𝜑″ ↔ [𝐹 / 𝑓]𝜑′)
15		bnj124.3	. . . . 5 ⊢ (𝜓″ ↔ [𝐹 / 𝑓]𝜓′)
16	13, 14, 15, 5	bnj206 35296	. . . 4 ⊢ ([𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″))
17	16	imbi2i 339	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))
18	3, 8, 17	3bitri 300	. 2 ⊢ ([𝐹 / 𝑓]𝜁′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))
19	1, 18	bitri 278	1 ⊢ (𝜁″ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3450  [wsbc 3738  ∅c0 4278  {csn 4583  ⟨cop 4589   Fn wfn 6522  1_oc1o 8447   predc-bnj14 35253   FrSe w-bnj15 35257

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-12 2213  ax-ext 2732  ax-sep 5248  ax-pr 5390

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-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-fun 6529  df-fn 6530

This theorem is used by:  bnj150  35440  bnj153  35444