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

Theorem bnj1296 35763
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
bnj1296.1 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1296.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1296.3 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1296.4 𝐷 = (dom 𝑔 ∩ dom ℎ)
bnj1296.5 𝐸 = {𝑥 ∈ 𝐷 ∣ (𝑔‘𝑥) ≠ (ℎ‘𝑥)}
bnj1296.6 (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷)))
bnj1296.7 (𝜓 ↔ (𝜑 ∧ 𝑥 ∈ 𝐸 ∧ ∀𝑦 ∈ 𝐸 ¬ 𝑦𝑅𝑥))
bnj1296.18 (𝜓 → (𝑔 ↾ pred(𝑥, 𝐴, 𝑅)) = (ℎ ↾ pred(𝑥, 𝐴, 𝑅)))
bnj1296.9 𝑍 = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1296.10 𝐾 = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))}
bnj1296.11 𝑊 = ⟨𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1296.12 𝐿 = {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊))}
Assertion
Ref Expression
bnj1296 (𝜓 → (𝑔‘𝑥) = (ℎ‘𝑥))
Distinct variable groups:   𝐵,𝑓,𝑔   𝐵,ℎ,𝑓   𝑥,𝐷   𝐺,𝑑,𝑓,𝑔   ℎ,𝐺,𝑑   𝑊,𝑑,𝑓   𝑔,𝑌   ℎ,𝑌   𝑍,𝑑,𝑓   𝑥,𝑑,𝑓,𝑔   𝑥,ℎ
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝜓(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐴(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐵(𝑥, 𝑦, 𝑑)   𝐶(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐷(𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝑅(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐸(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐺(𝑥, 𝑦)   𝐾(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝐿(𝑥, 𝑦, 𝑓, 𝑔, ℎ, 𝑑)   𝑊(𝑥, 𝑦, 𝑔, ℎ)   𝑌(𝑥, 𝑦, 𝑓, 𝑑)   𝑍(𝑥, 𝑦, 𝑔, ℎ)

Proof of Theorem bnj1296
StepHypRef Expression
1 bnj1296.18 . . . . 5 (𝜓 → (𝑔 ↾ pred(𝑥, 𝐴, 𝑅)) = (ℎ ↾ pred(𝑥, 𝐴, 𝑅)))
21opeq2d 4851 . . . 4 (𝜓 → ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))⟩)
3 bnj1296.9 . . . 4 𝑍 = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩
4 bnj1296.11 . . . 4 𝑊 = ⟨𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))⟩
52, 3, 43eqtr4g 2826 . . 3 (𝜓 → 𝑍 = 𝑊)
65fveq2d 6919 . 2 (𝜓 → (𝐺‘𝑍) = (𝐺‘𝑊))
7 bnj1296.7 . . . 4 (𝜓 ↔ (𝜑 ∧ 𝑥 ∈ 𝐸 ∧ ∀𝑦 ∈ 𝐸 ¬ 𝑦𝑅𝑥))
8 bnj1296.6 . . . . 5 (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷)))
9 bnj1296.10 . . . . . . . . . . 11 𝐾 = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))}
109bnj1436 35581 . . . . . . . . . 10 (𝑔 ∈ 𝐾 → ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))
11 fndm 6671 . . . . . . . . . . 11 (𝑔 Fn 𝑑 → dom 𝑔 = 𝑑)
1211anim1i 627 . . . . . . . . . 10 ((𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)) → (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))
1310, 12bnj31 35462 . . . . . . . . 9 (𝑔 ∈ 𝐾 → ∃𝑑 ∈ 𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))
14 raleq 3320 . . . . . . . . . . 11 (dom 𝑔 = 𝑑 → (∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍) ↔ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))
1514pm5.32i 585 . . . . . . . . . 10 ((dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍)) ↔ (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))
1615rexbii 3116 . . . . . . . . 9 (∃𝑑 ∈ 𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍)) ↔ ∃𝑑 ∈ 𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))
1713, 16sylibr 237 . . . . . . . 8 (𝑔 ∈ 𝐾 → ∃𝑑 ∈ 𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍)))
18 simpr 490 . . . . . . . 8 ((dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍)) → ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍))
1917, 18bnj31 35462 . . . . . . 7 (𝑔 ∈ 𝐾 → ∃𝑑 ∈ 𝐵 ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍))
2019bnj1265 35554 . . . . . 6 (𝑔 ∈ 𝐾 → ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍))
21 bnj1296.2 . . . . . . 7 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
22 bnj1296.3 . . . . . . 7 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
2321, 22, 3, 9bnj1234 35755 . . . . . 6 𝐶 = 𝐾
2420, 23eleq2s 2885 . . . . 5 (𝑔 ∈ 𝐶 → ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍))
258, 24bnj770 35506 . . . 4 (𝜑 → ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍))
267, 25bnj835 35502 . . 3 (𝜓 → ∀𝑥 ∈ dom 𝑔(𝑔‘𝑥) = (𝐺‘𝑍))
27 bnj1296.4 . . . . 5 𝐷 = (dom 𝑔 ∩ dom ℎ)
2827bnj1292 35557 . . . 4 𝐷 ⊆ dom 𝑔
29 bnj1296.5 . . . . 5 𝐸 = {𝑥 ∈ 𝐷 ∣ (𝑔‘𝑥) ≠ (ℎ‘𝑥)}
3029, 7bnj1212 35541 . . . 4 (𝜓 → 𝑥 ∈ 𝐷)
3128, 30bnj1213 35540 . . 3 (𝜓 → 𝑥 ∈ dom 𝑔)
3226, 31bnj1294 35559 . 2 (𝜓 → (𝑔‘𝑥) = (𝐺‘𝑍))
33 bnj1296.12 . . . . . . . . . . 11 𝐿 = {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊))}
3433bnj1436 35581 . . . . . . . . . 10 (ℎ ∈ 𝐿 → ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊)))
35 fndm 6671 . . . . . . . . . . 11 (ℎ Fn 𝑑 → dom ℎ = 𝑑)
3635anim1i 627 . . . . . . . . . 10 ((ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊)) → (dom ℎ = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊)))
3734, 36bnj31 35462 . . . . . . . . 9 (ℎ ∈ 𝐿 → ∃𝑑 ∈ 𝐵 (dom ℎ = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊)))
38 raleq 3320 . . . . . . . . . . 11 (dom ℎ = 𝑑 → (∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊) ↔ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊)))
3938pm5.32i 585 . . . . . . . . . 10 ((dom ℎ = 𝑑 ∧ ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊)) ↔ (dom ℎ = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊)))
4039rexbii 3116 . . . . . . . . 9 (∃𝑑 ∈ 𝐵 (dom ℎ = 𝑑 ∧ ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊)) ↔ ∃𝑑 ∈ 𝐵 (dom ℎ = 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑊)))
4137, 40sylibr 237 . . . . . . . 8 (ℎ ∈ 𝐿 → ∃𝑑 ∈ 𝐵 (dom ℎ = 𝑑 ∧ ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊)))
42 simpr 490 . . . . . . . 8 ((dom ℎ = 𝑑 ∧ ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊)) → ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊))
4341, 42bnj31 35462 . . . . . . 7 (ℎ ∈ 𝐿 → ∃𝑑 ∈ 𝐵 ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊))
4443bnj1265 35554 . . . . . 6 (ℎ ∈ 𝐿 → ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊))
4521, 22, 4, 33bnj1234 35755 . . . . . 6 𝐶 = 𝐿
4644, 45eleq2s 2885 . . . . 5 (ℎ ∈ 𝐶 → ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊))
478, 46bnj771 35507 . . . 4 (𝜑 → ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊))
487, 47bnj835 35502 . . 3 (𝜓 → ∀𝑥 ∈ dom ℎ(ℎ‘𝑥) = (𝐺‘𝑊))
4927bnj1293 35558 . . . 4 𝐷 ⊆ dom ℎ
5049, 30bnj1213 35540 . . 3 (𝜓 → 𝑥 ∈ dom ℎ)
5148, 50bnj1294 35559 . 2 (𝜓 → (ℎ‘𝑥) = (𝐺‘𝑊))
526, 32, 513eqtr4d 2811 1 (𝜓 → (𝑔‘𝑥) = (ℎ‘𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  {cab 2744   ≠ wne 2962  ∀wral 3083  ∃wrex 3093  {crab 3415   ⊆ wss 3899   ∩ cin 4091  ⟨cop 4839   class class class wbr 5107  dom cdm 5657   ↾ cres 5659   Fn wfn 6560  ‘cfv 6565   ∧ w-bnj17 35429   predc-bnj14 35431   FrSe w-bnj15 35435
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-12 2219  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  df-bnj17 35430
This theorem is used by:  bnj1311  35766
  Copyright terms: Public domain W3C validator