Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1097 Structured version   Visualization version   GIF version

Theorem bnj1097 35314
Description: Technical lemma for bnj69 35343. 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
StepHypRef Expression
1 bnj1097.3 . . . . . . . 8 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
2 bnj1097.1 . . . . . . . . 9 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
32biimpi 219 . . . . . . . 8 (𝜑 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
41, 3bnj771 35098 . . . . . . 7 (𝜒 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
543ad2ant3 1151 . . . . . 6 ((𝜃𝜏𝜒) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
65adantr 485 . . . . 5 (((𝜃𝜏𝜒) ∧ 𝜑0) → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
7 bnj1097.5 . . . . . . . 8 (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
87simp3bi 1163 . . . . . . 7 (𝜏 → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
983ad2ant2 1150 . . . . . 6 ((𝜃𝜏𝜒) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
109adantr 485 . . . . 5 (((𝜃𝜏𝜒) ∧ 𝜑0) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
116, 10jca 520 . . . 4 (((𝜃𝜏𝜒) ∧ 𝜑0) → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
1211anim2i 628 . . 3 ((𝑖 = ∅ ∧ ((𝜃𝜏𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
13 3anass 1109 . . 3 ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) ↔ (𝑖 = ∅ ∧ ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)))
1412, 13sylibr 237 . 2 ((𝑖 = ∅ ∧ ((𝜃𝜏𝜒) ∧ 𝜑0)) → (𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
15 fveqeq2 6891 . . . . . 6 (𝑖 = ∅ → ((𝑓𝑖) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)))
1615biimpar 482 . . . . 5 ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) → (𝑓𝑖) = pred(𝑋, 𝐴, 𝑅))
1716adantr 485 . . . 4 (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓𝑖) = pred(𝑋, 𝐴, 𝑅))
18 simpr 489 . . . 4 (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
1917, 18eqsstrd 3977 . . 3 (((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓𝑖) ⊆ 𝐵)
20193impa 1125 . 2 ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓𝑖) ⊆ 𝐵)
2114, 20syl 18 1 ((𝑖 = ∅ ∧ ((𝜃𝜏𝜒) ∧ 𝜑0)) → (𝑓𝑖) ⊆ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  Vcvv 3461  wss 3911  c0 4292   Fn wfn 6532  cfv 6537  w-bnj17 35020   predc-bnj14 35022   TrFow-bnj19 35030
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3423  df-v 3463  df-dif 3914  df-un 3916  df-ss 3928  df-nul 4293  df-if 4491  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5112  df-iota 6493  df-fv 6545  df-bnj17 35021
This theorem is referenced by:  bnj1030  35320
  Copyright terms: Public domain W3C validator