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

Theorem bnj1234 35755
Description: Technical lemma for bnj60 35804. 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
bnj1234.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1234.3 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1234.4 𝑍 = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1234.5 𝐷 = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))}
Assertion
Ref Expression
bnj1234 𝐶 = 𝐷
Distinct variable groups:   𝐵,𝑓,𝑔   𝑓,𝐺,𝑔   𝑔,𝑌   𝑓,𝑍   𝑓,𝑑,𝑔   𝑥,𝑓,𝑔
Allowed substitution hints:   𝐴(𝑥, 𝑓, 𝑔, 𝑑)   𝐵(𝑥, 𝑑)   𝐶(𝑥, 𝑓, 𝑔, 𝑑)   𝐷(𝑥, 𝑓, 𝑔, 𝑑)   𝑅(𝑥, 𝑓, 𝑔, 𝑑)   𝐺(𝑥, 𝑑)   𝑌(𝑥, 𝑓, 𝑑)   𝑍(𝑥, 𝑔, 𝑑)

Proof of Theorem bnj1234
StepHypRef Expression
1 fneq1 6659 . . . . 5 (𝑓 = 𝑔 → (𝑓 Fn 𝑑 ↔ 𝑔 Fn 𝑑))
2 fveq1 6914 . . . . . . 7 (𝑓 = 𝑔 → (𝑓‘𝑥) = (𝑔‘𝑥))
3 reseq1 5979 . . . . . . . . . 10 (𝑓 = 𝑔 → (𝑓 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝑔 ↾ pred(𝑥, 𝐴, 𝑅)))
43opeq2d 4851 . . . . . . . . 9 (𝑓 = 𝑔 → ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
5 bnj1234.2 . . . . . . . . 9 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
6 bnj1234.4 . . . . . . . . 9 𝑍 = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩
74, 5, 63eqtr4g 2826 . . . . . . . 8 (𝑓 = 𝑔 → 𝑌 = 𝑍)
87fveq2d 6919 . . . . . . 7 (𝑓 = 𝑔 → (𝐺‘𝑌) = (𝐺‘𝑍))
92, 8eqeq12d 2782 . . . . . 6 (𝑓 = 𝑔 → ((𝑓‘𝑥) = (𝐺‘𝑌) ↔ (𝑔‘𝑥) = (𝐺‘𝑍)))
109ralbidv 3192 . . . . 5 (𝑓 = 𝑔 → (∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌) ↔ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))
111, 10anbi12d 644 . . . 4 (𝑓 = 𝑔 → ((𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))))
1211rexbidv 3193 . . 3 (𝑓 = 𝑔 → (∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))))
1312cbvabv 2837 . 2 {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))}
14 bnj1234.3 . 2 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
15 bnj1234.5 . 2 𝐷 = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))}
1613, 14, 153eqtr4i 2799 1 𝐶 = 𝐷
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1572  {cab 2744  ∀wral 3083  ∃wrex 3093  ⟨cop 4839   ↾ cres 5659   Fn wfn 6560  ‘cfv 6565   predc-bnj14 35431
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-res 5669  df-iota 6519  df-fun 6567  df-fn 6568  df-fv 6573
This theorem is used by:  bnj1245  35756  bnj1256  35757  bnj1259  35758  bnj1296  35763  bnj1311  35766
  Copyright terms: Public domain W3C validator