Theorem xpord3indd 8097

Description: Induction over the triple Cartesian product ordering. Note that the substitutions cover all possible cases of membership in the predecessor class. (Contributed by Scott Fenton, 2-Feb-2025.)

Hypotheses

Ref	Expression
xpord3indd.x	⊢ (𝜅 → 𝑋 ∈ 𝐴)
xpord3indd.y	⊢ (𝜅 → 𝑌 ∈ 𝐵)
xpord3indd.z	⊢ (𝜅 → 𝑍 ∈ 𝐶)
xpord3indd.1	⊢ (𝜅 → 𝑅 Fr 𝐴)
xpord3indd.2	⊢ (𝜅 → 𝑅 Po 𝐴)
xpord3indd.3	⊢ (𝜅 → 𝑅 Se 𝐴)
xpord3indd.4	⊢ (𝜅 → 𝑆 Fr 𝐵)
xpord3indd.5	⊢ (𝜅 → 𝑆 Po 𝐵)
xpord3indd.6	⊢ (𝜅 → 𝑆 Se 𝐵)
xpord3indd.7	⊢ (𝜅 → 𝑇 Fr 𝐶)
xpord3indd.8	⊢ (𝜅 → 𝑇 Po 𝐶)
xpord3indd.9	⊢ (𝜅 → 𝑇 Se 𝐶)
xpord3indd.10	⊢ (𝑎 = 𝑑 → (𝜑 ↔ 𝜓))
xpord3indd.11	⊢ (𝑏 = 𝑒 → (𝜓 ↔ 𝜒))
xpord3indd.12	⊢ (𝑐 = 𝑓 → (𝜒 ↔ 𝜃))
xpord3indd.13	⊢ (𝑎 = 𝑑 → (𝜏 ↔ 𝜃))
xpord3indd.14	⊢ (𝑏 = 𝑒 → (𝜂 ↔ 𝜏))
xpord3indd.15	⊢ (𝑏 = 𝑒 → (𝜁 ↔ 𝜃))
xpord3indd.16	⊢ (𝑐 = 𝑓 → (𝜎 ↔ 𝜏))
xpord3indd.17	⊢ (𝑎 = 𝑋 → (𝜑 ↔ 𝜌))
xpord3indd.18	⊢ (𝑏 = 𝑌 → (𝜌 ↔ 𝜇))
xpord3indd.19	⊢ (𝑐 = 𝑍 → (𝜇 ↔ 𝜆))
xpord3indd.i	⊢ ((𝜅 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → (((∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜁) ∧ (∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)𝜎) ∧ ∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜂) → 𝜑))

Assertion

Ref	Expression
xpord3indd	⊢ (𝜅 → 𝜆)

Distinct variable groups:   𝐴,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐵,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐶,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑅,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑆,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑇,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑋,𝑎,𝑏,𝑐   𝑌,𝑏,𝑐   𝑍,𝑐   𝜅,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝜓,𝑎   𝜌,𝑎   𝜃,𝑎   𝜒,𝑏,𝑓   𝜇,𝑏   𝜃,𝑏   𝜆,𝑐   𝜃,𝑐   𝜑,𝑑   𝜏,𝑑   𝜂,𝑒   𝜓,𝑒   𝜁,𝑒   𝜎,𝑓

Allowed substitution hints:   𝜑(𝑒,𝑓,𝑎,𝑏,𝑐)   𝜓(𝑓,𝑏,𝑐,𝑑)   𝜒(𝑒,𝑎,𝑐,𝑑)   𝜃(𝑒,𝑓,𝑑)   𝜏(𝑒,𝑓,𝑎,𝑏,𝑐)   𝜂(𝑓,𝑎,𝑏,𝑐,𝑑)   𝜁(𝑓,𝑎,𝑏,𝑐,𝑑)   𝜎(𝑒,𝑎,𝑏,𝑐,𝑑)   𝜌(𝑒,𝑓,𝑏,𝑐,𝑑)   𝜇(𝑒,𝑓,𝑎,𝑐,𝑑)   𝜆(𝑒,𝑓,𝑎,𝑏,𝑑)   𝑋(𝑒,𝑓,𝑑)   𝑌(𝑒,𝑓,𝑎,𝑑)   𝑍(𝑒,𝑓,𝑎,𝑏,𝑑)

Proof of Theorem xpord3indd

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2736	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ 𝑦 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ ((((1st ‘(1st ‘𝑥))𝑅(1st ‘(1st ‘𝑦)) ∨ (1st ‘(1st ‘𝑥)) = (1st ‘(1st ‘𝑦))) ∧ ((2nd ‘(1st ‘𝑥))𝑆(2nd ‘(1st ‘𝑦)) ∨ (2nd ‘(1st ‘𝑥)) = (2nd ‘(1st ‘𝑦))) ∧ ((2nd ‘𝑥)𝑇(2nd ‘𝑦) ∨ (2nd ‘𝑥) = (2nd ‘𝑦))) ∧ 𝑥 ≠ 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ 𝑦 ∈ ((𝐴 × 𝐵) × 𝐶) ∧ ((((1st ‘(1st ‘𝑥))𝑅(1st ‘(1st ‘𝑦)) ∨ (1st ‘(1st ‘𝑥)) = (1st ‘(1st ‘𝑦))) ∧ ((2nd ‘(1st ‘𝑥))𝑆(2nd ‘(1st ‘𝑦)) ∨ (2nd ‘(1st ‘𝑥)) = (2nd ‘(1st ‘𝑦))) ∧ ((2nd ‘𝑥)𝑇(2nd ‘𝑦) ∨ (2nd ‘𝑥) = (2nd ‘𝑦))) ∧ 𝑥 ≠ 𝑦))}
2		xpord3indd.x	. 2 ⊢ (𝜅 → 𝑋 ∈ 𝐴)
3		xpord3indd.y	. 2 ⊢ (𝜅 → 𝑌 ∈ 𝐵)
4		xpord3indd.z	. 2 ⊢ (𝜅 → 𝑍 ∈ 𝐶)
5		xpord3indd.1	. 2 ⊢ (𝜅 → 𝑅 Fr 𝐴)
6		xpord3indd.2	. 2 ⊢ (𝜅 → 𝑅 Po 𝐴)
7		xpord3indd.3	. 2 ⊢ (𝜅 → 𝑅 Se 𝐴)
8		xpord3indd.4	. 2 ⊢ (𝜅 → 𝑆 Fr 𝐵)
9		xpord3indd.5	. 2 ⊢ (𝜅 → 𝑆 Po 𝐵)
10		xpord3indd.6	. 2 ⊢ (𝜅 → 𝑆 Se 𝐵)
11		xpord3indd.7	. 2 ⊢ (𝜅 → 𝑇 Fr 𝐶)
12		xpord3indd.8	. 2 ⊢ (𝜅 → 𝑇 Po 𝐶)
13		xpord3indd.9	. 2 ⊢ (𝜅 → 𝑇 Se 𝐶)
14		xpord3indd.10	. 2 ⊢ (𝑎 = 𝑑 → (𝜑 ↔ 𝜓))
15		xpord3indd.11	. 2 ⊢ (𝑏 = 𝑒 → (𝜓 ↔ 𝜒))
16		xpord3indd.12	. 2 ⊢ (𝑐 = 𝑓 → (𝜒 ↔ 𝜃))
17		xpord3indd.13	. 2 ⊢ (𝑎 = 𝑑 → (𝜏 ↔ 𝜃))
18		xpord3indd.14	. 2 ⊢ (𝑏 = 𝑒 → (𝜂 ↔ 𝜏))
19		xpord3indd.15	. 2 ⊢ (𝑏 = 𝑒 → (𝜁 ↔ 𝜃))
20		xpord3indd.16	. 2 ⊢ (𝑐 = 𝑓 → (𝜎 ↔ 𝜏))
21		xpord3indd.17	. 2 ⊢ (𝑎 = 𝑋 → (𝜑 ↔ 𝜌))
22		xpord3indd.18	. 2 ⊢ (𝑏 = 𝑌 → (𝜌 ↔ 𝜇))
23		xpord3indd.19	. 2 ⊢ (𝑐 = 𝑍 → (𝜇 ↔ 𝜆))
24		xpord3indd.i	. 2 ⊢ ((𝜅 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) → (((∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜁) ∧ (∀𝑑 ∈ Pred (𝑅, 𝐴, 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred (𝑆, 𝐵, 𝑏)𝜎) ∧ ∀𝑓 ∈ Pred (𝑇, 𝐶, 𝑐)𝜂) → 𝜑))
25	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24	xpord3inddlem 8096	1 ⊢ (𝜅 → 𝜆)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2932  ∀wral 3051   class class class wbr 5098  {copab 5160   Po wpo 5530   Fr wfr 5574   Se wse 5575   × cxp 5622  Predcpred 6258  ‘cfv 6492  1^st c1st 7931  2^nd c2nd 7932

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-ot 4589  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-po 5532  df-fr 5577  df-se 5578  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-iota 6448  df-fun 6494  df-fv 6500  df-1st 7933  df-2nd 7934

This theorem is referenced by:  xpord3ind  8098