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

Theorem bnj1280 35717
Description: Technical lemma for bnj60 35759. 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
bnj1280.1 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1280.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1280.3 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1280.4 𝐷 = (dom 𝑔 ∩ dom ℎ)
bnj1280.5 𝐸 = {𝑥 ∈ 𝐷 ∣ (𝑔‘𝑥) ≠ (ℎ‘𝑥)}
bnj1280.6 (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷)))
bnj1280.7 (𝜓 ↔ (𝜑 ∧ 𝑥 ∈ 𝐸 ∧ ∀𝑦 ∈ 𝐸 ¬ 𝑦𝑅𝑥))
bnj1280.17 (𝜓 → ( pred(𝑥, 𝐴, 𝑅) ∩ 𝐸) = ∅)
Assertion
Ref Expression
bnj1280 (𝜓 → (𝑔 ↾ pred(𝑥, 𝐴, 𝑅)) = (ℎ ↾ pred(𝑥, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑑,𝑓   𝐵,𝑓,𝑔   𝐵,ℎ,𝑓   𝐷,𝑑,𝑥   𝑓,𝐺,𝑔   ℎ,𝐺   𝑅,𝑑,𝑓   𝑔,𝑌   ℎ,𝑌   𝑔,𝑑   𝑥,𝑓,𝑔   ℎ,𝑑,𝑥
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝜓(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐴(𝑥, 𝑦, 𝑔, ℎ)   𝐵(𝑥, 𝑦, 𝑑)   𝐶(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐷(𝑦, 𝑓, 𝑔, ℎ)   𝑅(𝑥, 𝑦, 𝑔, ℎ)   𝐸(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐺(𝑥, 𝑦, 𝑑)   𝑌(𝑥, 𝑦, 𝑓, 𝑑)

Proof of Theorem bnj1280
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 bnj1280.1 . . . . . . . 8 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
2 bnj1280.2 . . . . . . . 8 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
3 bnj1280.3 . . . . . . . 8 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
4 bnj1280.4 . . . . . . . 8 𝐷 = (dom 𝑔 ∩ dom ℎ)
5 bnj1280.5 . . . . . . . 8 𝐸 = {𝑥 ∈ 𝐷 ∣ (𝑔‘𝑥) ≠ (ℎ‘𝑥)}
6 bnj1280.6 . . . . . . . 8 (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷)))
7 bnj1280.7 . . . . . . . 8 (𝜓 ↔ (𝜑 ∧ 𝑥 ∈ 𝐸 ∧ ∀𝑦 ∈ 𝐸 ¬ 𝑦𝑅𝑥))
81, 2, 3, 4, 5, 6, 7bnj1286 35716 . . . . . . 7 (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ 𝐷)
98sseld 3912 . . . . . 6 (𝜓 → (𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → 𝑧 ∈ 𝐷))
10 bnj1280.17 . . . . . . . . 9 (𝜓 → ( pred(𝑥, 𝐴, 𝑅) ∩ 𝐸) = ∅)
11 disj1 4408 . . . . . . . . 9 (( pred(𝑥, 𝐴, 𝑅) ∩ 𝐸) = ∅ ↔ ∀𝑧(𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → ¬ 𝑧 ∈ 𝐸))
1210, 11sylib 221 . . . . . . . 8 (𝜓 → ∀𝑧(𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → ¬ 𝑧 ∈ 𝐸))
131219.21bi 2229 . . . . . . 7 (𝜓 → (𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → ¬ 𝑧 ∈ 𝐸))
14 fveq2 6905 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝑔‘𝑥) = (𝑔‘𝑧))
15 fveq2 6905 . . . . . . . . . . 11 (𝑥 = 𝑧 → (ℎ‘𝑥) = (ℎ‘𝑧))
1614, 15neeq12d 3020 . . . . . . . . . 10 (𝑥 = 𝑧 → ((𝑔‘𝑥) ≠ (ℎ‘𝑥) ↔ (𝑔‘𝑧) ≠ (ℎ‘𝑧)))
1716, 5elrab2 3652 . . . . . . . . 9 (𝑧 ∈ 𝐸 ↔ (𝑧 ∈ 𝐷 ∧ (𝑔‘𝑧) ≠ (ℎ‘𝑧)))
1817notbii 323 . . . . . . . 8 (¬ 𝑧 ∈ 𝐸 ↔ ¬ (𝑧 ∈ 𝐷 ∧ (𝑔‘𝑧) ≠ (ℎ‘𝑧)))
19 imnan 405 . . . . . . . 8 ((𝑧 ∈ 𝐷 → ¬ (𝑔‘𝑧) ≠ (ℎ‘𝑧)) ↔ ¬ (𝑧 ∈ 𝐷 ∧ (𝑔‘𝑧) ≠ (ℎ‘𝑧)))
20 nne 2963 . . . . . . . . 9 (¬ (𝑔‘𝑧) ≠ (ℎ‘𝑧) ↔ (𝑔‘𝑧) = (ℎ‘𝑧))
2120imbi2i 339 . . . . . . . 8 ((𝑧 ∈ 𝐷 → ¬ (𝑔‘𝑧) ≠ (ℎ‘𝑧)) ↔ (𝑧 ∈ 𝐷 → (𝑔‘𝑧) = (ℎ‘𝑧)))
2218, 19, 213bitr2i 302 . . . . . . 7 (¬ 𝑧 ∈ 𝐸 ↔ (𝑧 ∈ 𝐷 → (𝑔‘𝑧) = (ℎ‘𝑧)))
2313, 22imbitrdi 254 . . . . . 6 (𝜓 → (𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → (𝑧 ∈ 𝐷 → (𝑔‘𝑧) = (ℎ‘𝑧))))
249, 23mpdd 44 . . . . 5 (𝜓 → (𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → (𝑔‘𝑧) = (ℎ‘𝑧)))
2524imp 412 . . . 4 ((𝜓 ∧ 𝑧 ∈ pred(𝑥, 𝐴, 𝑅)) → (𝑔‘𝑧) = (ℎ‘𝑧))
26 fvres 6924 . . . . . 6 (𝑧 ∈ 𝐷 → ((𝑔 ↾ 𝐷)‘𝑧) = (𝑔‘𝑧))
279, 26syl6 36 . . . . 5 (𝜓 → (𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → ((𝑔 ↾ 𝐷)‘𝑧) = (𝑔‘𝑧)))
2827imp 412 . . . 4 ((𝜓 ∧ 𝑧 ∈ pred(𝑥, 𝐴, 𝑅)) → ((𝑔 ↾ 𝐷)‘𝑧) = (𝑔‘𝑧))
29 fvres 6924 . . . . . 6 (𝑧 ∈ 𝐷 → ((ℎ ↾ 𝐷)‘𝑧) = (ℎ‘𝑧))
309, 29syl6 36 . . . . 5 (𝜓 → (𝑧 ∈ pred(𝑥, 𝐴, 𝑅) → ((ℎ ↾ 𝐷)‘𝑧) = (ℎ‘𝑧)))
3130imp 412 . . . 4 ((𝜓 ∧ 𝑧 ∈ pred(𝑥, 𝐴, 𝑅)) → ((ℎ ↾ 𝐷)‘𝑧) = (ℎ‘𝑧))
3225, 28, 313eqtr4d 2808 . . 3 ((𝜓 ∧ 𝑧 ∈ pred(𝑥, 𝐴, 𝑅)) → ((𝑔 ↾ 𝐷)‘𝑧) = ((ℎ ↾ 𝐷)‘𝑧))
3332ralrimiva 3158 . 2 (𝜓 → ∀𝑧 ∈ pred (𝑥, 𝐴, 𝑅)((𝑔 ↾ 𝐷)‘𝑧) = ((ℎ ↾ 𝐷)‘𝑧))
348resabs1d 6010 . . . 4 (𝜓 → ((𝑔 ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) = (𝑔 ↾ pred(𝑥, 𝐴, 𝑅)))
358resabs1d 6010 . . . 4 (𝜓 → ((ℎ ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) = (ℎ ↾ pred(𝑥, 𝐴, 𝑅)))
3634, 35eqeq12d 2779 . . 3 (𝜓 → (((𝑔 ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) = ((ℎ ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) ↔ (𝑔 ↾ pred(𝑥, 𝐴, 𝑅)) = (ℎ ↾ pred(𝑥, 𝐴, 𝑅))))
371, 2, 3, 4, 5, 6, 7bnj1256 35712 . . . . . . 7 (𝜑 → ∃𝑑 ∈ 𝐵 𝑔 Fn 𝑑)
384bnj1292 35512 . . . . . . . . 9 𝐷 ⊆ dom 𝑔
39 fndm 6661 . . . . . . . . 9 (𝑔 Fn 𝑑 → dom 𝑔 = 𝑑)
4038, 39sseqtrid 3955 . . . . . . . 8 (𝑔 Fn 𝑑 → 𝐷 ⊆ 𝑑)
41 fnssres 6681 . . . . . . . 8 ((𝑔 Fn 𝑑 ∧ 𝐷 ⊆ 𝑑) → (𝑔 ↾ 𝐷) Fn 𝐷)
4240, 41mpdan 700 . . . . . . 7 (𝑔 Fn 𝑑 → (𝑔 ↾ 𝐷) Fn 𝐷)
4337, 42bnj31 35417 . . . . . 6 (𝜑 → ∃𝑑 ∈ 𝐵 (𝑔 ↾ 𝐷) Fn 𝐷)
4443bnj1265 35509 . . . . 5 (𝜑 → (𝑔 ↾ 𝐷) Fn 𝐷)
457, 44bnj835 35457 . . . 4 (𝜓 → (𝑔 ↾ 𝐷) Fn 𝐷)
461, 2, 3, 4, 5, 6, 7bnj1259 35713 . . . . . . 7 (𝜑 → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑)
474bnj1293 35513 . . . . . . . . 9 𝐷 ⊆ dom ℎ
48 fndm 6661 . . . . . . . . 9 (ℎ Fn 𝑑 → dom ℎ = 𝑑)
4947, 48sseqtrid 3955 . . . . . . . 8 (ℎ Fn 𝑑 → 𝐷 ⊆ 𝑑)
50 fnssres 6681 . . . . . . . 8 ((ℎ Fn 𝑑 ∧ 𝐷 ⊆ 𝑑) → (ℎ ↾ 𝐷) Fn 𝐷)
5149, 50mpdan 700 . . . . . . 7 (ℎ Fn 𝑑 → (ℎ ↾ 𝐷) Fn 𝐷)
5246, 51bnj31 35417 . . . . . 6 (𝜑 → ∃𝑑 ∈ 𝐵 (ℎ ↾ 𝐷) Fn 𝐷)
5352bnj1265 35509 . . . . 5 (𝜑 → (ℎ ↾ 𝐷) Fn 𝐷)
547, 53bnj835 35457 . . . 4 (𝜓 → (ℎ ↾ 𝐷) Fn 𝐷)
55 fvreseq 7059 . . . 4 ((((𝑔 ↾ 𝐷) Fn 𝐷 ∧ (ℎ ↾ 𝐷) Fn 𝐷) ∧ pred(𝑥, 𝐴, 𝑅) ⊆ 𝐷) → (((𝑔 ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) = ((ℎ ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) ↔ ∀𝑧 ∈ pred (𝑥, 𝐴, 𝑅)((𝑔 ↾ 𝐷)‘𝑧) = ((ℎ ↾ 𝐷)‘𝑧)))
5645, 54, 8, 55syl21anc 851 . . 3 (𝜓 → (((𝑔 ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) = ((ℎ ↾ 𝐷) ↾ pred(𝑥, 𝐴, 𝑅)) ↔ ∀𝑧 ∈ pred (𝑥, 𝐴, 𝑅)((𝑔 ↾ 𝐷)‘𝑧) = ((ℎ ↾ 𝐷)‘𝑧)))
5736, 56bitr3d 284 . 2 (𝜓 → ((𝑔 ↾ pred(𝑥, 𝐴, 𝑅)) = (ℎ ↾ pred(𝑥, 𝐴, 𝑅)) ↔ ∀𝑧 ∈ pred (𝑥, 𝐴, 𝑅)((𝑔 ↾ 𝐷)‘𝑧) = ((ℎ ↾ 𝐷)‘𝑧)))
5833, 57mpbird 260 1 (𝜓 → (𝑔 ↾ pred(𝑥, 𝐴, 𝑅)) = (ℎ ↾ pred(𝑥, 𝐴, 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  {crab 3416   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ⟨cop 4838   class class class wbr 5106  dom cdm 5655   ↾ cres 5657   Fn wfn 6550  ‘cfv 6555   ∧ w-bnj17 35384   predc-bnj14 35386   FrSe w-bnj15 35390
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-fv 6563  df-bnj17 35385
This theorem is used by:  bnj1311  35721
  Copyright terms: Public domain W3C validator