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

Theorem frinxp 5771
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 3989 . . . . . . . . . . 11 (𝑧𝐴 → (𝑥𝑧𝑥𝐴))
2 ssel 3989 . . . . . . . . . . 11 (𝑧𝐴 → (𝑦𝑧𝑦𝐴))
31, 2anim12d 609 . . . . . . . . . 10 (𝑧𝐴 → ((𝑥𝑧𝑦𝑧) → (𝑥𝐴𝑦𝐴)))
4 brinxp 5767 . . . . . . . . . . 11 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
54ancoms 458 . . . . . . . . . 10 ((𝑥𝐴𝑦𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
63, 5syl6 35 . . . . . . . . 9 (𝑧𝐴 → ((𝑥𝑧𝑦𝑧) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
76impl 455 . . . . . . . 8 (((𝑧𝐴𝑥𝑧) ∧ 𝑦𝑧) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
87notbid 318 . . . . . . 7 (((𝑧𝐴𝑥𝑧) ∧ 𝑦𝑧) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
98ralbidva 3174 . . . . . 6 ((𝑧𝐴𝑥𝑧) → (∀𝑦𝑧 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
109rexbidva 3175 . . . . 5 (𝑧𝐴 → (∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1110adantr 480 . . . 4 ((𝑧𝐴𝑧 ≠ ∅) → (∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1211pm5.74i 271 . . 3 (((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥) ↔ ((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1312albii 1816 . 2 (∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥) ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
14 df-fr 5641 . 2 (𝑅 Fr 𝐴 ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦𝑅𝑥))
15 df-fr 5641 . 2 ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ↔ ∀𝑧((𝑧𝐴𝑧 ≠ ∅) → ∃𝑥𝑧𝑦𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
1613, 14, 153bitr4i 303 1 (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1535  wcel 2106  wne 2938  wral 3059  wrex 3068  cin 3962  wss 3963  c0 4339   class class class wbr 5148   Fr wfr 5638   × cxp 5687
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-fr 5641  df-xp 5695
This theorem is referenced by:  weinxp  5773
  Copyright terms: Public domain W3C validator