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 30343
Description: Technical lemma for bnj60 30384. 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 4347 . . . 4 (𝜓 → ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, ( ↾ pred(𝑥, 𝐴, 𝑅))⟩)
3 bnj1296.9 . . . 4 𝑍 = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩
4 bnj1296.11 . . . 4 𝑊 = ⟨𝑥, ( ↾ pred(𝑥, 𝐴, 𝑅))⟩
52, 3, 43eqtr4g 2669 . . 3 (𝜓𝑍 = 𝑊)
65fveq2d 6107 . 2 (𝜓 → (𝐺𝑍) = (𝐺𝑊))
7 bnj1296.7 . . . 4 (𝜓 ↔ (𝜑𝑥𝐸 ∧ ∀𝑦𝐸 ¬ 𝑦𝑅𝑥))
8 bnj1296.6 . . . . 5 (𝜑 ↔ (𝑅 FrSe 𝐴𝑔𝐶𝐶 ∧ (𝑔𝐷) ≠ (𝐷)))
9 bnj1296.10 . . . . . . . . . . 11 𝐾 = {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍))}
109bnj1436 30164 . . . . . . . . . 10 (𝑔𝐾 → ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍)))
11 fndm 5904 . . . . . . . . . . 11 (𝑔 Fn 𝑑 → dom 𝑔 = 𝑑)
1211anim1i 590 . . . . . . . . . 10 ((𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍)) → (dom 𝑔 = 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍)))
1310, 12bnj31 30039 . . . . . . . . 9 (𝑔𝐾 → ∃𝑑𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍)))
14 raleq 3115 . . . . . . . . . . 11 (dom 𝑔 = 𝑑 → (∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍) ↔ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍)))
1514pm5.32i 667 . . . . . . . . . 10 ((dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍)) ↔ (dom 𝑔 = 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍)))
1615rexbii 3023 . . . . . . . . 9 (∃𝑑𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍)) ↔ ∃𝑑𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺𝑍)))
1713, 16sylibr 223 . . . . . . . 8 (𝑔𝐾 → ∃𝑑𝐵 (dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍)))
18 simpr 476 . . . . . . . 8 ((dom 𝑔 = 𝑑 ∧ ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍)) → ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍))
1917, 18bnj31 30039 . . . . . . 7 (𝑔𝐾 → ∃𝑑𝐵𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍))
2019bnj1265 30137 . . . . . 6 (𝑔𝐾 → ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍))
21 bnj1296.2 . . . . . . 7 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
22 bnj1296.3 . . . . . . 7 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
2321, 22, 3, 9bnj1234 30335 . . . . . 6 𝐶 = 𝐾
2420, 23eleq2s 2706 . . . . 5 (𝑔𝐶 → ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍))
258, 24bnj770 30087 . . . 4 (𝜑 → ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍))
267, 25bnj835 30083 . . 3 (𝜓 → ∀𝑥 ∈ dom 𝑔(𝑔𝑥) = (𝐺𝑍))
27 bnj1296.4 . . . . 5 𝐷 = (dom 𝑔 ∩ dom )
2827bnj1292 30140 . . . 4 𝐷 ⊆ dom 𝑔
29 bnj1296.5 . . . . 5 𝐸 = {𝑥𝐷 ∣ (𝑔𝑥) ≠ (𝑥)}
3029, 7bnj1212 30124 . . . 4 (𝜓𝑥𝐷)
3128, 30bnj1213 30123 . . 3 (𝜓𝑥 ∈ dom 𝑔)
3226, 31bnj1294 30142 . 2 (𝜓 → (𝑔𝑥) = (𝐺𝑍))
33 bnj1296.12 . . . . . . . . . . 11 𝐿 = { ∣ ∃𝑑𝐵 ( Fn 𝑑 ∧ ∀𝑥𝑑 (𝑥) = (𝐺𝑊))}
3433bnj1436 30164 . . . . . . . . . 10 (𝐿 → ∃𝑑𝐵 ( Fn 𝑑 ∧ ∀𝑥𝑑 (𝑥) = (𝐺𝑊)))
35 fndm 5904 . . . . . . . . . . 11 ( Fn 𝑑 → dom = 𝑑)
3635anim1i 590 . . . . . . . . . 10 (( Fn 𝑑 ∧ ∀𝑥𝑑 (𝑥) = (𝐺𝑊)) → (dom = 𝑑 ∧ ∀𝑥𝑑 (𝑥) = (𝐺𝑊)))
3734, 36bnj31 30039 . . . . . . . . 9 (𝐿 → ∃𝑑𝐵 (dom = 𝑑 ∧ ∀𝑥𝑑 (𝑥) = (𝐺𝑊)))
38 raleq 3115 . . . . . . . . . . 11 (dom = 𝑑 → (∀𝑥 ∈ dom (𝑥) = (𝐺𝑊) ↔ ∀𝑥𝑑 (𝑥) = (𝐺𝑊)))
3938pm5.32i 667 . . . . . . . . . 10 ((dom = 𝑑 ∧ ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊)) ↔ (dom = 𝑑 ∧ ∀𝑥𝑑 (𝑥) = (𝐺𝑊)))
4039rexbii 3023 . . . . . . . . 9 (∃𝑑𝐵 (dom = 𝑑 ∧ ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊)) ↔ ∃𝑑𝐵 (dom = 𝑑 ∧ ∀𝑥𝑑 (𝑥) = (𝐺𝑊)))
4137, 40sylibr 223 . . . . . . . 8 (𝐿 → ∃𝑑𝐵 (dom = 𝑑 ∧ ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊)))
42 simpr 476 . . . . . . . 8 ((dom = 𝑑 ∧ ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊)) → ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊))
4341, 42bnj31 30039 . . . . . . 7 (𝐿 → ∃𝑑𝐵𝑥 ∈ dom (𝑥) = (𝐺𝑊))
4443bnj1265 30137 . . . . . 6 (𝐿 → ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊))
4521, 22, 4, 33bnj1234 30335 . . . . . 6 𝐶 = 𝐿
4644, 45eleq2s 2706 . . . . 5 (𝐶 → ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊))
478, 46bnj771 30088 . . . 4 (𝜑 → ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊))
487, 47bnj835 30083 . . 3 (𝜓 → ∀𝑥 ∈ dom (𝑥) = (𝐺𝑊))
4927bnj1293 30141 . . . 4 𝐷 ⊆ dom
5049, 30bnj1213 30123 . . 3 (𝜓𝑥 ∈ dom )
5148, 50bnj1294 30142 . 2 (𝜓 → (𝑥) = (𝐺𝑊))
526, 32, 513eqtr4d 2654 1 (𝜓 → (𝑔𝑥) = (𝑥))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  {cab 2596  wne 2780  wral 2896  wrex 2897  {crab 2900  cin 3539  wss 3540  cop 4131   class class class wbr 4583  dom cdm 5038  cres 5040   Fn wfn 5799  cfv 5804  w-bnj17 30005   predc-bnj14 30007   FrSe w-bnj15 30011
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-res 5050  df-iota 5768  df-fun 5806  df-fn 5807  df-fv 5812  df-bnj17 30006
This theorem is referenced by:  bnj1311  30346
  Copyright terms: Public domain W3C validator