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

Theorem bnj554 35612
Description: Technical lemma for bnj852 35634. 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
bnj554.19 (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
bnj554.20 (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖))
bnj554.21 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj554.22 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
bnj554.23 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj554.24 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
Assertion
Ref Expression
bnj554 ((𝜂 ∧ 𝜁) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾))
Distinct variable groups:   𝑦,𝐺   𝑦,𝑖   𝑦,𝑝
Allowed substitution hints:   𝜂(𝑦, 𝑖, 𝑚, 𝑛, 𝑝)   𝜁(𝑦, 𝑖, 𝑚, 𝑛, 𝑝)   𝐴(𝑦, 𝑖, 𝑚, 𝑛, 𝑝)   𝐷(𝑦, 𝑖, 𝑚, 𝑛, 𝑝)   𝑅(𝑦, 𝑖, 𝑚, 𝑛, 𝑝)   𝐺(𝑖, 𝑚, 𝑛, 𝑝)   𝐾(𝑦, 𝑖, 𝑚, 𝑛, 𝑝)   𝐿(𝑦, 𝑖, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj554
StepHypRef Expression
1 bnj554.19 . . 3 (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
21bnj1254 35522 . 2 (𝜂 → 𝑚 = suc 𝑝)
3 bnj554.20 . . 3 (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖))
43simp3bi 1165 . 2 (𝜁 → 𝑚 = suc 𝑖)
5 simpr 490 . . 3 ((𝑚 = suc 𝑝 ∧ 𝑚 = suc 𝑖) → 𝑚 = suc 𝑖)
6 bnj551 35456 . . 3 ((𝑚 = suc 𝑝 ∧ 𝑚 = suc 𝑖) → 𝑝 = 𝑖)
7 fveq2 6911 . . . 4 (𝑚 = suc 𝑖 → (𝐺‘𝑚) = (𝐺‘suc 𝑖))
8 fveq2 6911 . . . . 5 (𝑝 = 𝑖 → (𝐺‘𝑝) = (𝐺‘𝑖))
9 iuneq1 4971 . . . . . 6 ((𝐺‘𝑝) = (𝐺‘𝑖) → ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
10 bnj554.24 . . . . . 6 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
11 bnj554.23 . . . . . 6 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
129, 10, 113eqtr4g 2823 . . . . 5 ((𝐺‘𝑝) = (𝐺‘𝑖) → 𝐿 = 𝐾)
138, 12syl 18 . . . 4 (𝑝 = 𝑖 → 𝐿 = 𝐾)
147, 13eqeqan12d 2777 . . 3 ((𝑚 = suc 𝑖 ∧ 𝑝 = 𝑖) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾))
155, 6, 14syl2anc 596 . 2 ((𝑚 = suc 𝑝 ∧ 𝑚 = suc 𝑖) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾))
162, 4, 15syl2an 608 1 ((𝜂 ∧ 𝜁) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∪ ciun 4954  suc csuc 6385  ‘cfv 6561  ωcom 7904   ∧ w-bnj17 35400   predc-bnj14 35402
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-ext 2735  ax-sep 5253  ax-pr 5396  ax-un 7778  ax-reg 9616
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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-eprel 5556  df-fr 5609  df-suc 6389  df-iota 6515  df-fv 6569  df-bnj17 35401
This theorem is used by:  bnj558  35615
  Copyright terms: Public domain W3C validator