Theorem bnj124 32147

Description: Technical lemma for bnj150 32152. 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 3832	. . 3 ⊢ ([𝐹 / 𝑓]𝜁′ ↔ [𝐹 / 𝑓]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
4		bnj124.1	. . . . 5 ⊢ 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
5	4	bnj95 32140	. . . 4 ⊢ 𝐹 ∈ V
6		nfv 1914	. . . . 5 ⊢ Ⅎ𝑓(𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴)
7	6	sbc19.21g 3849	. . . 4 ⊢ (𝐹 ∈ V → ([𝐹 / 𝑓]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))))
8	5, 7	ax-mp 5	. . 3 ⊢ ([𝐹 / 𝑓]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
9		fneq1 6447	. . . . . . . 8 ⊢ (𝑓 = 𝑧 → (𝑓 Fn 1o ↔ 𝑧 Fn 1o))
10		fneq1 6447	. . . . . . . 8 ⊢ (𝑧 = 𝐹 → (𝑧 Fn 1o ↔ 𝐹 Fn 1o))
11	9, 10	sbcie2g 3814	. . . . . . 7 ⊢ (𝐹 ∈ V → ([𝐹 / 𝑓]𝑓 Fn 1o ↔ 𝐹 Fn 1o))
12	5, 11	ax-mp 5	. . . . . 6 ⊢ ([𝐹 / 𝑓]𝑓 Fn 1o ↔ 𝐹 Fn 1o)
13	12	bicomi 226	. . . . 5 ⊢ (𝐹 Fn 1o ↔ [𝐹 / 𝑓]𝑓 Fn 1o)
14		bnj124.2	. . . . 5 ⊢ (𝜑″ ↔ [𝐹 / 𝑓]𝜑′)
15		bnj124.3	. . . . 5 ⊢ (𝜓″ ↔ [𝐹 / 𝑓]𝜓′)
16	13, 14, 15, 5	bnj206 32005	. . . 4 ⊢ ([𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″))
17	16	imbi2i 338	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝐹 / 𝑓](𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))
18	3, 8, 17	3bitri 299	. 2 ⊢ ([𝐹 / 𝑓]𝜁′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))
19	1, 18	bitri 277	1 ⊢ (𝜁″ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 1o ∧ 𝜑″ ∧ 𝜓″)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1536   ∈ wcel 2113  Vcvv 3497  [wsbc 3775  ∅c0 4294  {csn 4570  ⟨cop 4576   Fn wfn 6353  1_oc1o 8098   predc-bnj14 31962   FrSe w-bnj15 31966

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-rab 3150  df-v 3499  df-sbc 3776  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-br 5070  df-opab 5132  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-fun 6360  df-fn 6361

This theorem is referenced by:  bnj150  32152  bnj153  32156