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

Theorem frinxp 5744
Description: Intersection of well-founded relation with Cartesian product of its field. (Contributed by Mario Carneiro, 10-Jul-2014.)
Assertion
Ref Expression
frinxp (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)

Proof of Theorem frinxp
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssel 3931 . . . . . . . . . . 11 (𝑧𝐴 → (𝑥𝑧𝑥𝐴))
2 ssel 3931 . . . . . . . . . . 11 (𝑧𝐴 → (𝑦𝑧𝑦𝐴))
31, 2anim12d 620 . . . . . . . . . 10 (𝑧𝐴 → ((𝑥𝑧𝑦𝑧) → (𝑥𝐴𝑦𝐴)))
4 brinxp 5740 . . . . . . . . . . 11 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
54ancoms 463 . . . . . . . . . 10 ((𝑥𝐴𝑦𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
63, 5syl6 36 . . . . . . . . 9 (𝑧𝐴 → ((𝑥𝑧𝑦𝑧) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
76impl 460 . . . . . . . 8 (((𝑧𝐴𝑥𝑧) ∧ 𝑦𝑧) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
87notbid 321 . . . . . . 7 (((𝑧𝐴𝑥𝑧) ∧ 𝑦𝑧) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
98ralbidva 3186 . . . . . 6 ((𝑧𝐴𝑥𝑧) → (∀𝑦𝑧 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
109rexbidva 3187 . . . . 5 (𝑧𝐴 → (∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1110adantr 485 . . . 4 ((𝑧𝐴𝑧 ≠ ∅) → (∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1211pm5.74i 274 . . 3 (((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥) ↔ ((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1312albii 1849 . 2 (∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥) ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
14 df-fr 5614 . 2 (𝑅 Fr 𝐴 ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥))
15 df-fr 5614 . 2 ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1613, 14, 153bitr4i 306 1 (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  wal 1568  wcel 2143  wne 2958  wral 3079  wrex 3089  cin 3904  wss 3905  c0 4286   class class class wbr 5109   Fr wfr 5611   × cxp 5659
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-fr 5614  df-xp 5667
This theorem is referenced by:  weinxp  5746
  Copyright terms: Public domain W3C validator