Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnwe2lem1 Structured version   Visualization version   GIF version

Theorem fnwe2lem1 37620
Description: Lemma for fnwe2 37623. 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
fnwe2lem1 ((𝜑𝑎𝐴) → (𝐹𝑎) / 𝑧𝑆 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑎)})
Distinct variable groups:   𝑦,𝑈,𝑧,𝑎   𝑥,𝑆,𝑦,𝑎   𝑥,𝑅,𝑦,𝑎   𝜑,𝑥,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧,𝑎   𝑥,𝐹,𝑦,𝑧,𝑎   𝑇,𝑎
Allowed substitution hints:   𝜑(𝑎)   𝑅(𝑧)   𝑆(𝑧)   𝑇(𝑥,𝑦,𝑧)   𝑈(𝑥)

Proof of Theorem fnwe2lem1
StepHypRef Expression
1 fnwe2.s . . . 4 ((𝜑𝑥𝐴) → 𝑈 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑥)})
21ralrimiva 2966 . . 3 (𝜑 → ∀𝑥𝐴 𝑈 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑥)})
3 fveq2 6191 . . . . . . 7 (𝑎 = 𝑥 → (𝐹𝑎) = (𝐹𝑥))
43csbeq1d 3540 . . . . . 6 (𝑎 = 𝑥(𝐹𝑎) / 𝑧𝑆 = (𝐹𝑥) / 𝑧𝑆)
5 fvex 6201 . . . . . . 7 (𝐹𝑥) ∈ V
6 fnwe2.su . . . . . . 7 (𝑧 = (𝐹𝑥) → 𝑆 = 𝑈)
75, 6csbie 3559 . . . . . 6 (𝐹𝑥) / 𝑧𝑆 = 𝑈
84, 7syl6eq 2672 . . . . 5 (𝑎 = 𝑥(𝐹𝑎) / 𝑧𝑆 = 𝑈)
93eqeq2d 2632 . . . . . 6 (𝑎 = 𝑥 → ((𝐹𝑦) = (𝐹𝑎) ↔ (𝐹𝑦) = (𝐹𝑥)))
109rabbidv 3189 . . . . 5 (𝑎 = 𝑥 → {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑎)} = {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑥)})
118, 10weeq12d 37610 . . . 4 (𝑎 = 𝑥 → ((𝐹𝑎) / 𝑧𝑆 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑎)} ↔ 𝑈 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑥)}))
1211cbvralv 3171 . . 3 (∀𝑎𝐴 (𝐹𝑎) / 𝑧𝑆 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑎)} ↔ ∀𝑥𝐴 𝑈 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑥)})
132, 12sylibr 224 . 2 (𝜑 → ∀𝑎𝐴 (𝐹𝑎) / 𝑧𝑆 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑎)})
1413r19.21bi 2932 1 ((𝜑𝑎𝐴) → (𝐹𝑎) / 𝑧𝑆 We {𝑦𝐴 ∣ (𝐹𝑦) = (𝐹𝑎)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 383  wa 384   = wceq 1483  wcel 1990  wral 2912  {crab 2916  csb 3533   class class class wbr 4653  {copab 4712   We wwe 5072  cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-iota 5851  df-fv 5896
This theorem is referenced by:  fnwe2lem2  37621  fnwe2lem3  37622
  Copyright terms: Public domain W3C validator