Theorem bnj1097 34995

Description: Technical lemma for bnj69 35024. 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 216	. . . . . . . 8 ⊢ (𝜑 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
4	1, 3	bnj771 34778	. . . . . . 7 ⊢ (𝜒 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
5	4	3ad2ant3 1136	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
6	5	adantr 480	. . . . 5 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
7		bnj1097.5	. . . . . . . 8 ⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
8	7	simp3bi 1148	. . . . . . 7 ⊢ (𝜏 → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
9	8	3ad2ant2 1135	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
10	9	adantr 480	. . . . 5 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
11	6, 10	jca 511	. . . 4 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
12	11	anim2i 617	. . 3 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
13		3anass 1095	. . 3 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) ↔ (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
14	12, 13	sylibr 234	. 2 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
15		fveqeq2 6915	. . . . . 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 4018	. . 3 ⊢ (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) ⊆ 𝐵)
20	19	3impa 1110	. 2 ⊢ ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) ⊆ 𝐵)
21	14, 20	syl 17	1 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108  Vcvv 3480   ⊆ wss 3951  ∅c0 4333   Fn wfn 6556  ‘cfv 6561   ∧ w-bnj17 34700   predc-bnj14 34702   TrFow-bnj19 34710

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 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-iota 6514  df-fv 6569  df-bnj17 34701

This theorem is referenced by:  bnj1030  35001