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

Theorem sexp3 8139
Description: Show that the triple order is set-like. (Contributed by Scott Fenton, 21-Aug-2024.)
Hypotheses
Ref Expression
xpord3.1 𝑈 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ 𝑦 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ ((((1st ‘(1st𝑥))𝑅(1st ‘(1st𝑦)) ∨ (1st ‘(1st𝑥)) = (1st ‘(1st𝑦))) ∧ ((2nd ‘(1st𝑥))𝑆(2nd ‘(1st𝑦)) ∨ (2nd ‘(1st𝑥)) = (2nd ‘(1st𝑦))) ∧ ((2nd𝑥)𝑇(2nd𝑦) ∨ (2nd𝑥) = (2nd𝑦))) ∧ 𝑥𝑦))}
sexp3.1 (𝜑𝑅 Se 𝐴)
sexp3.2 (𝜑𝑆 Se 𝐵)
sexp3.3 (𝜑𝑇 Se 𝐶)
Assertion
Ref Expression
sexp3 (𝜑𝑈 Se ((𝐴 × 𝐵) × 𝐶))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝑈(𝑥,𝑦)

Proof of Theorem sexp3
Dummy variables 𝑎 𝑏 𝑐 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 el2xptp 8021 . . . 4 (𝑝 ∈ ((𝐴 × 𝐵) × 𝐶) ↔ ∃𝑎𝐴𝑏𝐵𝑐𝐶 𝑝 = ⟨𝑎, 𝑏, 𝑐⟩)
2 df-3an 1090 . . . . . . . 8 ((𝑎𝐴𝑏𝐵𝑐𝐶) ↔ ((𝑎𝐴𝑏𝐵) ∧ 𝑐𝐶))
3 xpord3.1 . . . . . . . . . . . 12 𝑈 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ 𝑦 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ ((((1st ‘(1st𝑥))𝑅(1st ‘(1st𝑦)) ∨ (1st ‘(1st𝑥)) = (1st ‘(1st𝑦))) ∧ ((2nd ‘(1st𝑥))𝑆(2nd ‘(1st𝑦)) ∨ (2nd ‘(1st𝑥)) = (2nd ‘(1st𝑦))) ∧ ((2nd𝑥)𝑇(2nd𝑦) ∨ (2nd𝑥) = (2nd𝑦))) ∧ 𝑥𝑦))}
43xpord3pred 8138 . . . . . . . . . . 11 ((𝑎𝐴𝑏𝐵𝑐𝐶) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) = ((((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∖ {⟨𝑎, 𝑏, 𝑐⟩}))
54adantl 483 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) = ((((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∖ {⟨𝑎, 𝑏, 𝑐⟩}))
6 simpr1 1195 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → 𝑎𝐴)
7 sexp3.1 . . . . . . . . . . . . . . . 16 (𝜑𝑅 Se 𝐴)
87adantr 482 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → 𝑅 Se 𝐴)
9 setlikespec 6327 . . . . . . . . . . . . . . 15 ((𝑎𝐴𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑎) ∈ V)
106, 8, 9syl2anc 585 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → Pred(𝑅, 𝐴, 𝑎) ∈ V)
11 vsnex 5430 . . . . . . . . . . . . . . 15 {𝑎} ∈ V
1211a1i 11 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → {𝑎} ∈ V)
1310, 12unexd 7741 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → (Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) ∈ V)
14 simpr2 1196 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → 𝑏𝐵)
15 sexp3.2 . . . . . . . . . . . . . . . 16 (𝜑𝑆 Se 𝐵)
1615adantr 482 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → 𝑆 Se 𝐵)
17 setlikespec 6327 . . . . . . . . . . . . . . 15 ((𝑏𝐵𝑆 Se 𝐵) → Pred(𝑆, 𝐵, 𝑏) ∈ V)
1814, 16, 17syl2anc 585 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → Pred(𝑆, 𝐵, 𝑏) ∈ V)
19 vsnex 5430 . . . . . . . . . . . . . . 15 {𝑏} ∈ V
2019a1i 11 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → {𝑏} ∈ V)
2118, 20unexd 7741 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏}) ∈ V)
2213, 21xpexd 7738 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → ((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) ∈ V)
23 simpr3 1197 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → 𝑐𝐶)
24 sexp3.3 . . . . . . . . . . . . . . 15 (𝜑𝑇 Se 𝐶)
2524adantr 482 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → 𝑇 Se 𝐶)
26 setlikespec 6327 . . . . . . . . . . . . . 14 ((𝑐𝐶𝑇 Se 𝐶) → Pred(𝑇, 𝐶, 𝑐) ∈ V)
2723, 25, 26syl2anc 585 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → Pred(𝑇, 𝐶, 𝑐) ∈ V)
28 vsnex 5430 . . . . . . . . . . . . . 14 {𝑐} ∈ V
2928a1i 11 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → {𝑐} ∈ V)
3027, 29unexd 7741 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐}) ∈ V)
3122, 30xpexd 7738 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → (((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∈ V)
3231difexd 5330 . . . . . . . . . 10 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → ((((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∖ {⟨𝑎, 𝑏, 𝑐⟩}) ∈ V)
335, 32eqeltrd 2834 . . . . . . . . 9 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) ∈ V)
34 predeq3 6305 . . . . . . . . . 10 (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) = Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩))
3534eleq1d 2819 . . . . . . . . 9 (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → (Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V ↔ Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) ∈ V))
3633, 35syl5ibrcom 246 . . . . . . . 8 ((𝜑 ∧ (𝑎𝐴𝑏𝐵𝑐𝐶)) → (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
372, 36sylan2br 596 . . . . . . 7 ((𝜑 ∧ ((𝑎𝐴𝑏𝐵) ∧ 𝑐𝐶)) → (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
3837anassrs 469 . . . . . 6 (((𝜑 ∧ (𝑎𝐴𝑏𝐵)) ∧ 𝑐𝐶) → (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
3938rexlimdva 3156 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑏𝐵)) → (∃𝑐𝐶 𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
4039rexlimdvva 3212 . . . 4 (𝜑 → (∃𝑎𝐴𝑏𝐵𝑐𝐶 𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
411, 40biimtrid 241 . . 3 (𝜑 → (𝑝 ∈ ((𝐴 × 𝐵) × 𝐶) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
4241ralrimiv 3146 . 2 (𝜑 → ∀𝑝 ∈ ((𝐴 × 𝐵) × 𝐶)Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V)
43 dfse3 6338 . 2 (𝑈 Se ((𝐴 × 𝐵) × 𝐶) ↔ ∀𝑝 ∈ ((𝐴 × 𝐵) × 𝐶)Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V)
4442, 43sylibr 233 1 (𝜑𝑈 Se ((𝐴 × 𝐵) × 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  wo 846  w3a 1088   = wceq 1542  wcel 2107  wne 2941  wral 3062  wrex 3071  Vcvv 3475  cdif 3946  cun 3947  {csn 4629  cotp 4637   class class class wbr 5149  {copab 5211   Se wse 5630   × cxp 5675  Predcpred 6300  cfv 6544  1st c1st 7973  2nd c2nd 7974
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 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725
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 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-ot 4638  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-se 5633  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-iota 6496  df-fun 6546  df-fv 6552  df-1st 7975  df-2nd 7976
This theorem is referenced by:  xpord3inddlem  8140
  Copyright terms: Public domain W3C validator