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

Theorem fnwe2lem1 8158
Description: Lemma for fnwe2 8162. Substitute variables. (Contributed by Stefan O'Rear, 19-Jan-2015.)
Hypotheses
Ref Expression
fnwe2.su (𝑧 = (𝐹‘𝑥) → 𝑆 = 𝑈)
fnwe2.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ((𝐹‘𝑥)𝑅(𝐹‘𝑦) ∨ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥𝑈𝑦))}
Assertion
Ref Expression
fnwe2lem1 (𝑎𝑇𝑏 ↔ ((𝐹‘𝑎)𝑅(𝐹‘𝑏) ∨ ((𝐹‘𝑎) = (𝐹‘𝑏) ∧ 𝑎⦋(𝐹‘𝑎) / 𝑧⦌𝑆𝑏)))
Distinct variable groups:   𝑦,𝑈,𝑧,𝑎,𝑏   𝑥,𝑆,𝑦,𝑎,𝑏   𝑥,𝑅,𝑦,𝑎,𝑏   𝑥,𝑧,𝐹,𝑦,𝑎,𝑏   𝑇,𝑎,𝑏
Allowed substitution hints:   𝑅(𝑧)   𝑆(𝑧)   𝑇(𝑥, 𝑦, 𝑧)   𝑈(𝑥)

Proof of Theorem fnwe2lem1
StepHypRef Expression
1 vex 3458 . 2 𝑎 ∈ V
2 vex 3458 . 2 𝑏 ∈ V
3 fveq2 6896 . . . 4 (𝑥 = 𝑎 → (𝐹‘𝑥) = (𝐹‘𝑎))
4 fveq2 6896 . . . 4 (𝑦 = 𝑏 → (𝐹‘𝑦) = (𝐹‘𝑏))
53, 4breqan12d 5122 . . 3 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → ((𝐹‘𝑥)𝑅(𝐹‘𝑦) ↔ (𝐹‘𝑎)𝑅(𝐹‘𝑏)))
63, 4eqeqan12d 2777 . . . 4 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝐹‘𝑎) = (𝐹‘𝑏)))
7 simpl 488 . . . . 5 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → 𝑥 = 𝑎)
8 fvex 6909 . . . . . . . 8 (𝐹‘𝑥) ∈ V
9 fnwe2.su . . . . . . . 8 (𝑧 = (𝐹‘𝑥) → 𝑆 = 𝑈)
108, 9csbie 3886 . . . . . . 7 ⦋(𝐹‘𝑥) / 𝑧⦌𝑆 = 𝑈
113csbeq1d 3855 . . . . . . 7 (𝑥 = 𝑎 → ⦋(𝐹‘𝑥) / 𝑧⦌𝑆 = ⦋(𝐹‘𝑎) / 𝑧⦌𝑆)
1210, 11eqtr3id 2812 . . . . . 6 (𝑥 = 𝑎 → 𝑈 = ⦋(𝐹‘𝑎) / 𝑧⦌𝑆)
1312adantr 486 . . . . 5 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → 𝑈 = ⦋(𝐹‘𝑎) / 𝑧⦌𝑆)
14 simpr 490 . . . . 5 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → 𝑦 = 𝑏)
157, 13, 14breq123d 5120 . . . 4 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → (𝑥𝑈𝑦 ↔ 𝑎⦋(𝐹‘𝑎) / 𝑧⦌𝑆𝑏))
166, 15anbi12d 644 . . 3 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → (((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥𝑈𝑦) ↔ ((𝐹‘𝑎) = (𝐹‘𝑏) ∧ 𝑎⦋(𝐹‘𝑎) / 𝑧⦌𝑆𝑏)))
175, 16orbi12d 932 . 2 ((𝑥 = 𝑎 ∧ 𝑦 = 𝑏) → (((𝐹‘𝑥)𝑅(𝐹‘𝑦) ∨ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥𝑈𝑦)) ↔ ((𝐹‘𝑎)𝑅(𝐹‘𝑏) ∨ ((𝐹‘𝑎) = (𝐹‘𝑏) ∧ 𝑎⦋(𝐹‘𝑎) / 𝑧⦌𝑆𝑏))))
18 fnwe2.t . 2 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ((𝐹‘𝑥)𝑅(𝐹‘𝑦) ∨ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥𝑈𝑦))}
191, 2, 17, 18braba 5515 1 (𝑎𝑇𝑏 ↔ ((𝐹‘𝑎)𝑅(𝐹‘𝑏) ∨ ((𝐹‘𝑎) = (𝐹‘𝑏) ∧ 𝑎⦋(𝐹‘𝑎) / 𝑧⦌𝑆𝑏)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569  ⦋csb 3851   class class class wbr 5106  {copab 5170  ‘cfv 6547
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-iota 6501  df-fv 6555
This theorem is used by:  fnwe2lem3  8160  fnwe2lem4  8161
  Copyright terms: Public domain W3C validator