Theorem bnj1097 35611

Description: Technical lemma for bnj69 35640. 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 219	. . . . . . . 8 ⊢ (𝜑 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
4	1, 3	bnj771 35395	. . . . . . 7 ⊢ (𝜒 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
5	4	3ad2ant3 1153	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
6	5	adantr 486	. . . . 5 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
7		bnj1097.5	. . . . . . . 8 ⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
8	7	simp3bi 1165	. . . . . . 7 ⊢ (𝜏 → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
9	8	3ad2ant2 1152	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
10	9	adantr 486	. . . . 5 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
11	6, 10	jca 521	. . . 4 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
12	11	anim2i 629	. . 3 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
13		3anass 1111	. . 3 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) ↔ (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
14	12, 13	sylibr 237	. 2 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
15		fveqeq2 6894	. . . . . 6 ⊢ (𝑖 = ∅ → ((𝑓‘𝑖) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)))
16	15	biimpar 483	. . . . 5 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) → (𝑓‘𝑖) = pred(𝑋, 𝐴, 𝑅))
17	16	adantr 486	. . . 4 ⊢ (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) = pred(𝑋, 𝐴, 𝑅))
18		simpr 490	. . . 4 ⊢ (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
19	17, 18	eqsstrd 3942	. . 3 ⊢ (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) ⊆ 𝐵)
20	19	3impa 1127	. 2 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) ⊆ 𝐵)
21	14, 20	syl 18	1 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895  ∅c0 4278   Fn wfn 6533  ‘cfv 6538   ∧ w-bnj17 35317   predc-bnj14 35319   TrFow-bnj19 35327

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546  df-bnj17 35318

This theorem is used by:  bnj1030  35617