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

Theorem wemaplem3 9489
Description: Lemma for wemapso 9492. Transitivity. (Contributed by Stefan O'Rear, 17-Jan-2015.) (Revised by AV, 21-Jul-2024.)
Hypotheses
Ref Expression
wemapso.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧)𝑆(𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}
wemaplem2.p (𝜑𝑃 ∈ (𝐵m 𝐴))
wemaplem2.x (𝜑𝑋 ∈ (𝐵m 𝐴))
wemaplem2.q (𝜑𝑄 ∈ (𝐵m 𝐴))
wemaplem2.r (𝜑𝑅 Or 𝐴)
wemaplem2.s (𝜑𝑆 Po 𝐵)
wemaplem3.px (𝜑𝑃𝑇𝑋)
wemaplem3.xq (𝜑𝑋𝑇𝑄)
Assertion
Ref Expression
wemaplem3 (𝜑𝑃𝑇𝑄)
Distinct variable groups:   𝑥,𝐵   𝑥,𝑤,𝑦,𝑧,𝑋   𝑤,𝐴,𝑥,𝑦,𝑧   𝑤,𝑃,𝑥,𝑦,𝑧   𝑤,𝑄,𝑥,𝑦,𝑧   𝑤,𝑅,𝑥,𝑦,𝑧   𝑤,𝑆,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝐵(𝑦,𝑧,𝑤)   𝑇(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem wemaplem3
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wemaplem3.px . . 3 (𝜑𝑃𝑇𝑋)
2 wemaplem2.p . . . 4 (𝜑𝑃 ∈ (𝐵m 𝐴))
3 wemaplem2.x . . . 4 (𝜑𝑋 ∈ (𝐵m 𝐴))
4 wemapso.t . . . . 5 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 ((𝑥𝑧)𝑆(𝑦𝑧) ∧ ∀𝑤𝐴 (𝑤𝑅𝑧 → (𝑥𝑤) = (𝑦𝑤)))}
54wemaplem1 9487 . . . 4 ((𝑃 ∈ (𝐵m 𝐴) ∧ 𝑋 ∈ (𝐵m 𝐴)) → (𝑃𝑇𝑋 ↔ ∃𝑎𝐴 ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))))
62, 3, 5syl2anc 585 . . 3 (𝜑 → (𝑃𝑇𝑋 ↔ ∃𝑎𝐴 ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))))
71, 6mpbid 231 . 2 (𝜑 → ∃𝑎𝐴 ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))
8 wemaplem3.xq . . 3 (𝜑𝑋𝑇𝑄)
9 wemaplem2.q . . . 4 (𝜑𝑄 ∈ (𝐵m 𝐴))
104wemaplem1 9487 . . . 4 ((𝑋 ∈ (𝐵m 𝐴) ∧ 𝑄 ∈ (𝐵m 𝐴)) → (𝑋𝑇𝑄 ↔ ∃𝑏𝐴 ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)))))
113, 9, 10syl2anc 585 . . 3 (𝜑 → (𝑋𝑇𝑄 ↔ ∃𝑏𝐴 ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)))))
128, 11mpbid 231 . 2 (𝜑 → ∃𝑏𝐴 ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))
132ad2antrr 725 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑃 ∈ (𝐵m 𝐴))
143ad2antrr 725 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑋 ∈ (𝐵m 𝐴))
159ad2antrr 725 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑄 ∈ (𝐵m 𝐴))
16 wemaplem2.r . . . . . 6 (𝜑𝑅 Or 𝐴)
1716ad2antrr 725 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑅 Or 𝐴)
18 wemaplem2.s . . . . . 6 (𝜑𝑆 Po 𝐵)
1918ad2antrr 725 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑆 Po 𝐵)
20 simplrl 776 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑎𝐴)
21 simp2rl 1243 . . . . . 6 ((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → (𝑃𝑎)𝑆(𝑋𝑎))
22213expa 1119 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → (𝑃𝑎)𝑆(𝑋𝑎))
23 simprr 772 . . . . . 6 ((𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))) → ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))
2423ad2antlr 726 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐)))
25 simprl 770 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑏𝐴)
26 simprrl 780 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → (𝑋𝑏)𝑆(𝑄𝑏))
27 simprrr 781 . . . . 5 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐)))
284, 13, 14, 15, 17, 19, 20, 22, 24, 25, 26, 27wemaplem2 9488 . . . 4 (((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) ∧ (𝑏𝐴 ∧ ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))))) → 𝑃𝑇𝑄)
2928rexlimdvaa 3150 . . 3 ((𝜑 ∧ (𝑎𝐴 ∧ ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))))) → (∃𝑏𝐴 ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → 𝑃𝑇𝑄))
3029rexlimdvaa 3150 . 2 (𝜑 → (∃𝑎𝐴 ((𝑃𝑎)𝑆(𝑋𝑎) ∧ ∀𝑐𝐴 (𝑐𝑅𝑎 → (𝑃𝑐) = (𝑋𝑐))) → (∃𝑏𝐴 ((𝑋𝑏)𝑆(𝑄𝑏) ∧ ∀𝑐𝐴 (𝑐𝑅𝑏 → (𝑋𝑐) = (𝑄𝑐))) → 𝑃𝑇𝑄)))
317, 12, 30mp2d 49 1 (𝜑𝑃𝑇𝑄)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wral 3061  wrex 3070   class class class wbr 5106  {copab 5168   Po wpo 5544   Or wor 5545  cfv 6497  (class class class)co 7358  m cmap 8768
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5257  ax-nul 5264  ax-pow 5321  ax-pr 5385  ax-un 7673
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-sbc 3741  df-csb 3857  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-pw 4563  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-iun 4957  df-br 5107  df-opab 5169  df-mpt 5190  df-id 5532  df-po 5546  df-so 5547  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6449  df-fun 6499  df-fn 6500  df-f 6501  df-fv 6505  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7922  df-2nd 7923  df-map 8770
This theorem is referenced by:  wemappo  9490
  Copyright terms: Public domain W3C validator