HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem weinxp 2467
Description: Intersection of well-ordering with cross product of its field.
Assertion
Ref Expression
weinxp (R We A ↔ (R ∩ (A × A)) We A)

Proof of Theorem weinxp
StepHypRef Expression
1 ssel 1502 . . . . . . . . . . . . . 14 (zA → (xzxA))
2 ssel 1502 . . . . . . . . . . . . . 14 (zA → (yzyA))
31, 2anim12d 431 . . . . . . . . . . . . 13 (zA → ((xzyz) → (xAyA)))
43adantr 306 . . . . . . . . . . . 12 ((zA ∧ ¬ z = ∅) → ((xzyz) → (xAyA)))
5 brinxp 2466 . . . . . . . . . . . . 13 ((yAxA) → (yRxy(R ∩ (A × A))x))
65ancoms 334 . . . . . . . . . . . 12 ((xAyA) → (yRxy(R ∩ (A × A))x))
74, 6syl6 23 . . . . . . . . . . 11 ((zA ∧ ¬ z = ∅) → ((xzyz) → (yRxy(R ∩ (A × A))x)))
87exp3a 292 . . . . . . . . . 10 ((zA ∧ ¬ z = ∅) → (xz → (yz → (yRxy(R ∩ (A × A))x))))
98imp31 280 . . . . . . . . 9 ((((zA ∧ ¬ z = ∅) ∧ xz) ∧ yz) → (yRxy(R ∩ (A × A))x))
109negbid 463 . . . . . . . 8 ((((zA ∧ ¬ z = ∅) ∧ xz) ∧ yz) → (¬ yRx ↔ ¬ y(R ∩ (A × A))x))
1110biraldva 1215 . . . . . . 7 (((zA ∧ ¬ z = ∅) ∧ xz) → (∀yz ¬ yRx ↔ ∀yz ¬ y(R ∩ (A × A))x))
1211birexdva 1216 . . . . . 6 ((zA ∧ ¬ z = ∅) → (∃xzyz ¬ yRx ↔ ∃xzyz ¬ y(R ∩ (A × A))x))
1312pm5.74i 443 . . . . 5 (((zA ∧ ¬ z = ∅) → ∃xzyz ¬ yRx) ↔ ((zA ∧ ¬ z = ∅) → ∃xzyz ¬ y(R ∩ (A × A))x))
1413bial 695 . . . 4 (∀z((zA ∧ ¬ z = ∅) → ∃xzyz ¬ yRx) ↔ ∀z((zA ∧ ¬ z = ∅) → ∃xzyz ¬ y(R ∩ (A × A))x))
15 df-fr 2169 . . . 4 (R Fr A ↔ ∀z((zA ∧ ¬ z = ∅) → ∃xzyz ¬ yRx))
16 df-fr 2169 . . . 4 ((R ∩ (A × A)) Fr A ↔ ∀z((zA ∧ ¬ z = ∅) → ∃xzyz ¬ y(R ∩ (A × A))x))
1714, 15, 163bitr4 158 . . 3 (R Fr A ↔ (R ∩ (A × A)) Fr A)
18 brinxp 2466 . . . . . . 7 ((xAyA) → (xRyx(R ∩ (A × A))y))
19 pm4.2i 149 . . . . . . 7 ((xAyA) → (x = yx = y))
2018, 19, 6bi3ord 635 . . . . . 6 ((xAyA) → ((xRyx = yyRx) ↔ (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x)))
2120pm5.74i 443 . . . . 5 (((xAyA) → (xRyx = yyRx)) ↔ ((xAyA) → (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x)))
2221bi2al 696 . . . 4 (∀xy((xAyA) → (xRyx = yyRx)) ↔ ∀xy((xAyA) → (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x)))
23 r2al 1231 . . . 4 (∀xAyA (xRyx = yyRx) ↔ ∀xy((xAyA) → (xRyx = yyRx)))
24 r2al 1231 . . . 4 (∀xAyA (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x) ↔ ∀xy((xAyA) → (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x)))
2522, 23, 243bitr4 158 . . 3 (∀xAyA (xRyx = yyRx) ↔ ∀xAyA (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x))
2617, 25anbi12i 369 . 2 ((R Fr A ∧ ∀xAyA (xRyx = yyRx)) ↔ ((R ∩ (A × A)) Fr A ∧ ∀xAyA (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x)))
27 dfwe2 2187 . 2 (R We A ↔ (R Fr A ∧ ∀xAyA (xRyx = yyRx)))
28 dfwe2 2187 . 2 ((R ∩ (A × A)) We A ↔ ((R ∩ (A × A)) Fr A ∧ ∀xAyA (x(R ∩ (A × A))yx = yy(R ∩ (A × A))x)))
2926, 27, 283bitr4 158 1 (R We A ↔ (R ∩ (A × A)) We A)
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ↔ wb 127   ∧ wa 196   ∨ w3o 580  ∀wal 672   = weq 797   ∈ wel 803   = wceq 1091   ∈ wcel 1092  ∀wral 1201  ∃wrex 1202   ∩ cin 1486   ⊆ wss 1487  ∅c0 1707   class class class wbr 2054   Fr wfr 2061   We wwe 2062   × cxp 2408
This theorem is referenced by:  weth 3602
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-xp 2424
metamath.org