Theorem bnj1097 32861

Description: Technical lemma for bnj69 32890. 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.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1097.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1097.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1097.5	⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))

Assertion

Ref	Expression
bnj1097	⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)

Proof of Theorem bnj1097

Step	Hyp	Ref	Expression
1		bnj1097.3	. . . . . . . 8 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
2		bnj1097.1	. . . . . . . . 9 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
3	2	biimpi 215	. . . . . . . 8 ⊢ (𝜑 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
4	1, 3	bnj771 32644	. . . . . . 7 ⊢ (𝜒 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
5	4	3ad2ant3 1133	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
6	5	adantr 480	. . . . 5 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
7		bnj1097.5	. . . . . . . 8 ⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
8	7	simp3bi 1145	. . . . . . 7 ⊢ (𝜏 → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
9	8	3ad2ant2 1132	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
10	9	adantr 480	. . . . 5 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
11	6, 10	jca 511	. . . 4 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
12	11	anim2i 616	. . 3 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
13		3anass 1093	. . 3 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) ↔ (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
14	12, 13	sylibr 233	. 2 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
15		fveqeq2 6765	. . . . . 6 ⊢ (𝑖 = ∅ → ((𝑓‘𝑖) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)))
16	15	biimpar 477	. . . . 5 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) → (𝑓‘𝑖) = pred(𝑋, 𝐴, 𝑅))
17	16	adantr 480	. . . 4 ⊢ (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) = pred(𝑋, 𝐴, 𝑅))
18		simpr 484	. . . 4 ⊢ (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
19	17, 18	eqsstrd 3955	. . 3 ⊢ (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) ⊆ 𝐵)
20	19	3impa 1108	. 2 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) ⊆ 𝐵)
21	14, 20	syl 17	1 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  Vcvv 3422   ⊆ wss 3883  ∅c0 4253   Fn wfn 6413  ‘cfv 6418   ∧ w-bnj17 32565   predc-bnj14 32567   TrFow-bnj19 32575

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-iota 6376  df-fv 6426  df-bnj17 32566

This theorem is referenced by:  bnj1030  32867