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

Theorem fnwe2lem2 8149
Description: Lemma for fnwe2 8152. 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 3154 . . 3 (𝜑 → ∀𝑥 ∈ 𝐴 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
3 fveq2 6886 . . . . . . 7 (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥))
43csbeq1d 3850 . . . . . 6 (𝑎 = 𝑥 → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 = ⦋(𝐹‘𝑥) / 𝑧⦌𝑆)
5 fvex 6899 . . . . . . 7 (𝐹‘𝑥) ∈ V
6 fnwe2.su . . . . . . 7 (𝑧 = (𝐹‘𝑥) → 𝑆 = 𝑈)
75, 6csbie 3881 . . . . . 6 ⦋(𝐹‘𝑥) / 𝑧⦌𝑆 = 𝑈
84, 7eqtrdi 2811 . . . . 5 (𝑎 = 𝑥 → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 = 𝑈)
93eqeq2d 2771 . . . . . 6 (𝑎 = 𝑥 → ((𝐹‘𝑦) = (𝐹‘𝑎) ↔ (𝐹‘𝑦) = (𝐹‘𝑥)))
109rabbidv 3419 . . . . 5 (𝑎 = 𝑥 → {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
118, 10weeq12d 5639 . . . 4 (𝑎 = 𝑥 → (⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} ↔ 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)}))
1211cbvralvw 3240 . . 3 (∀𝑎 ∈ 𝐴 ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} ↔ ∀𝑥 ∈ 𝐴 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})
132, 12sylibr 237 . 2 (𝜑 → ∀𝑎 ∈ 𝐴 ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)})
1413r19.21bi 3254 1 ((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  ⦋csb 3846   class class class wbr 5102  {copab 5166   We wwe 5602  ‘cfv 6539
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732  ax-nul 5259
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-iota 6494  df-fv 6547
This theorem is used by:  fnwe2lem3  8150  fnwe2lem4  8151
  Copyright terms: Public domain W3C validator