Theorem sexp3 8085

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.

Step	Hyp	Ref	Expression
1		el2xptp 7967	. . . 4 ⊢ (𝑝 ∈ ((𝐴 × 𝐵) × 𝐶) ↔ ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 𝑝 = ⟨𝑎, 𝑏, 𝑐⟩)
2		df-3an 1089	. . . . . . . 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 ‘𝑦))) ∧ 𝑥 ≠ 𝑦))}
4	3	xpord3pred 8084	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) = ((((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∖ {⟨𝑎, 𝑏, 𝑐⟩}))
5	4	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) = ((((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∖ {⟨𝑎, 𝑏, 𝑐⟩}))
6		simpr1 1194	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → 𝑎 ∈ 𝐴)
7		sexp3.1	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑅 Se 𝐴)
8	7	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → 𝑅 Se 𝐴)
9		setlikespec 6279	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑎) ∈ V)
10	6, 8, 9	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → Pred(𝑅, 𝐴, 𝑎) ∈ V)
11		vsnex 5386	. . . . . . . . . . . . . . 15 ⊢ {𝑎} ∈ V
12	11	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → {𝑎} ∈ V)
13	10, 12	unexd 7688	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → (Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) ∈ V)
14		simpr2 1195	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → 𝑏 ∈ 𝐵)
15		sexp3.2	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑆 Se 𝐵)
16	15	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → 𝑆 Se 𝐵)
17		setlikespec 6279	. . . . . . . . . . . . . . 15 ⊢ ((𝑏 ∈ 𝐵 ∧ 𝑆 Se 𝐵) → Pred(𝑆, 𝐵, 𝑏) ∈ V)
18	14, 16, 17	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → Pred(𝑆, 𝐵, 𝑏) ∈ V)
19		vsnex 5386	. . . . . . . . . . . . . . 15 ⊢ {𝑏} ∈ V
20	19	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → {𝑏} ∈ V)
21	18, 20	unexd 7688	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏}) ∈ V)
22	13, 21	xpexd 7685	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → ((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) ∈ V)
23		simpr3 1196	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → 𝑐 ∈ 𝐶)
24		sexp3.3	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑇 Se 𝐶)
25	24	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → 𝑇 Se 𝐶)
26		setlikespec 6279	. . . . . . . . . . . . . 14 ⊢ ((𝑐 ∈ 𝐶 ∧ 𝑇 Se 𝐶) → Pred(𝑇, 𝐶, 𝑐) ∈ V)
27	23, 25, 26	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → Pred(𝑇, 𝐶, 𝑐) ∈ V)
28		vsnex 5386	. . . . . . . . . . . . . 14 ⊢ {𝑐} ∈ V
29	28	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → {𝑐} ∈ V)
30	27, 29	unexd 7688	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐}) ∈ V)
31	22, 30	xpexd 7685	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → (((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∈ V)
32	31	difexd 5286	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → ((((Pred(𝑅, 𝐴, 𝑎) ∪ {𝑎}) × (Pred(𝑆, 𝐵, 𝑏) ∪ {𝑏})) × (Pred(𝑇, 𝐶, 𝑐) ∪ {𝑐})) ∖ {⟨𝑎, 𝑏, 𝑐⟩}) ∈ V)
33	5, 32	eqeltrd 2838	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) ∈ V)
34		predeq3 6257	. . . . . . . . . 10 ⊢ (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) = Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩))
35	34	eleq1d 2822	. . . . . . . . 9 ⊢ (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → (Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V ↔ Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), ⟨𝑎, 𝑏, 𝑐⟩) ∈ V))
36	33, 35	syl5ibrcom 246	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
37	2, 36	sylan2br 595	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐶)) → (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
38	37	anassrs 468	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑐 ∈ 𝐶) → (𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
39	38	rexlimdva 3152	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → (∃𝑐 ∈ 𝐶 𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
40	39	rexlimdvva 3205	. . . 4 ⊢ (𝜑 → (∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 𝑝 = ⟨𝑎, 𝑏, 𝑐⟩ → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
41	1, 40	biimtrid 241	. . 3 ⊢ (𝜑 → (𝑝 ∈ ((𝐴 × 𝐵) × 𝐶) → Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V))
42	41	ralrimiv 3142	. 2 ⊢ (𝜑 → ∀𝑝 ∈ ((𝐴 × 𝐵) × 𝐶)Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V)
43		dfse3 6290	. 2 ⊢ (𝑈 Se ((𝐴 × 𝐵) × 𝐶) ↔ ∀𝑝 ∈ ((𝐴 × 𝐵) × 𝐶)Pred(𝑈, ((𝐴 × 𝐵) × 𝐶), 𝑝) ∈ V)
44	42, 43	sylibr 233	1 ⊢ (𝜑 → 𝑈 Se ((𝐴 × 𝐵) × 𝐶))

Syntax hints:   → wi 4   ∧ wa 396   ∨ wo 845   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  ∃wrex 3073  Vcvv 3445   ∖ cdif 3907   ∪ cun 3908  {csn 4586  ⟨cotp 4594   class class class wbr 5105  {copab 5167   Se wse 5586   × cxp 5631  Predcpred 6252  ‘cfv 6496  1^st c1st 7919  2^nd c2nd 7920

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-ot 4595  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-se 5589  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-iota 6448  df-fun 6498  df-fv 6504  df-1st 7921  df-2nd 7922

This theorem is referenced by:  xpord3inddlem  8086