MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnwe2lem2 Structured version   Visualization version   GIF version

Theorem fnwe2lem2 8183
Description: Lemma for fnwe2 8186. Substitution in well-ordering hypothesis. (Contributed by Stefan O'Rear, 19-Jan-2015.)
Hypotheses
Ref Expression
fnwe2.su (𝑧 = (𝐹‘𝑥) → 𝑆 = 𝑈)
fnwe2.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ((𝐹‘𝑥)𝑅(𝐹‘𝑦) ∨ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥𝑈𝑦))}
fnwe2.s ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
Assertion
Ref Expression
fnwe2lem2 ((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)})
Distinct variable groups:   𝑦,𝑈,𝑧,𝑎   𝑥,𝑆,𝑦,𝑎   𝑥,𝑅,𝑦,𝑎   𝜑,𝑥,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧,𝑎   𝑥,𝐹,𝑦,𝑧,𝑎   𝑇,𝑎
Allowed substitution hints:   𝜑(𝑎)   𝑅(𝑧)   𝑆(𝑧)   𝑇(𝑥, 𝑦, 𝑧)   𝑈(𝑥)

Proof of Theorem fnwe2lem2
StepHypRef Expression
1 fnwe2.s . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
21ralrimiva 3158 . . 3 (𝜑 → ∀𝑥 ∈ 𝐴 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
3 fveq2 6916 . . . . . . 7 (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥))
43csbeq1d 3855 . . . . . 6 (𝑎 = 𝑥 → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 = ⦋(𝐹‘𝑥) / 𝑧⦌𝑆)
5 fvex 6929 . . . . . . 7 (𝐹‘𝑥) ∈ V
6 fnwe2.su . . . . . . 7 (𝑧 = (𝐹‘𝑥) → 𝑆 = 𝑈)
75, 6csbie 3886 . . . . . 6 ⦋(𝐹‘𝑥) / 𝑧⦌𝑆 = 𝑈
84, 7eqtrdi 2814 . . . . 5 (𝑎 = 𝑥 → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 = 𝑈)
93eqeq2d 2774 . . . . . 6 (𝑎 = 𝑥 → ((𝐹‘𝑦) = (𝐹‘𝑎) ↔ (𝐹‘𝑦) = (𝐹‘𝑥)))
109rabbidv 3423 . . . . 5 (𝑎 = 𝑥 → {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
118, 10weeq12d 5647 . . . 4 (𝑎 = 𝑥 → (⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} ↔ 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)}))
1211cbvralvw 3244 . . 3 (∀𝑎 ∈ 𝐴 ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} ↔ ∀𝑥 ∈ 𝐴 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
132, 12sylibr 237 . 2 (𝜑 → ∀𝑎 ∈ 𝐴 ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)})
1413r19.21bi 3258 1 ((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  ⦋csb 3851   class class class wbr 5108  {copab 5173   We wwe 5610  ‘cfv 6566
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-12 2216  ax-ext 2735  ax-nul 5266
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-iota 6520  df-fv 6574
This theorem is used by:  fnwe2lem3  8184  fnwe2lem4  8185
  Copyright terms: Public domain W3C validator