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

Theorem no3inds 27950
Description: Triple induction over surreal numbers. (Contributed by Scott Fenton, 9-Oct-2024.)
Hypotheses
Ref Expression
no3inds.1 (𝑎 = 𝑑 → (𝜑𝜓))
no3inds.2 (𝑏 = 𝑒 → (𝜓𝜒))
no3inds.3 (𝑐 = 𝑓 → (𝜒𝜃))
no3inds.4 (𝑎 = 𝑑 → (𝜏𝜃))
no3inds.5 (𝑏 = 𝑒 → (𝜂𝜏))
no3inds.6 (𝑏 = 𝑒 → (𝜁𝜃))
no3inds.7 (𝑐 = 𝑓 → (𝜎𝜏))
no3inds.8 (𝑎 = 𝑋 → (𝜑𝜌))
no3inds.9 (𝑏 = 𝑌 → (𝜌𝜇))
no3inds.10 (𝑐 = 𝑍 → (𝜇𝜆))
no3inds.i ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁) ∧ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎) ∧ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂) → 𝜑))
Assertion
Ref Expression
no3inds ((𝑋 No 𝑌 No 𝑍 No ) → 𝜆)
Distinct variable groups:   𝑋,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑌,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑍,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝜓,𝑎   𝜌,𝑎   𝜃,𝑎,𝑏,𝑐   𝜒,𝑏,𝑓   𝜇,𝑏   𝜆,𝑐   𝜑,𝑑   𝜏,𝑑   𝜂,𝑒   𝜓,𝑒   𝜁,𝑒   𝜎,𝑓
Allowed substitution hints:   𝜑(𝑒,𝑓,𝑎,𝑏,𝑐)   𝜓(𝑓,𝑏,𝑐,𝑑)   𝜒(𝑒,𝑎,𝑐,𝑑)   𝜃(𝑒,𝑓,𝑑)   𝜏(𝑒,𝑓,𝑎,𝑏,𝑐)   𝜂(𝑓,𝑎,𝑏,𝑐,𝑑)   𝜁(𝑓,𝑎,𝑏,𝑐,𝑑)   𝜎(𝑒,𝑎,𝑏,𝑐,𝑑)   𝜌(𝑒,𝑓,𝑏,𝑐,𝑑)   𝜇(𝑒,𝑓,𝑎,𝑐,𝑑)   𝜆(𝑒,𝑓,𝑎,𝑏,𝑑)

Proof of Theorem no3inds
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . 3 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
21lrrecfr 27935 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} Fr No
31lrrecpo 27933 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} Po No
41lrrecse 27934 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} Se No
5 no3inds.1 . 2 (𝑎 = 𝑑 → (𝜑𝜓))
6 no3inds.2 . 2 (𝑏 = 𝑒 → (𝜓𝜒))
7 no3inds.3 . 2 (𝑐 = 𝑓 → (𝜒𝜃))
8 no3inds.4 . 2 (𝑎 = 𝑑 → (𝜏𝜃))
9 no3inds.5 . 2 (𝑏 = 𝑒 → (𝜂𝜏))
10 no3inds.6 . 2 (𝑏 = 𝑒 → (𝜁𝜃))
11 no3inds.7 . 2 (𝑐 = 𝑓 → (𝜎𝜏))
12 no3inds.8 . 2 (𝑎 = 𝑋 → (𝜑𝜌))
13 no3inds.9 . 2 (𝑏 = 𝑌 → (𝜌𝜇))
14 no3inds.10 . 2 (𝑐 = 𝑍 → (𝜇𝜆))
151lrrecpred 27936 . . . . . . 7 (𝑎 No → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎) = (( L ‘𝑎) ∪ ( R ‘𝑎)))
16153ad2ant1 1134 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎) = (( L ‘𝑎) ∪ ( R ‘𝑎)))
171lrrecpred 27936 . . . . . . . 8 (𝑏 No → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏) = (( L ‘𝑏) ∪ ( R ‘𝑏)))
18173ad2ant2 1135 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏) = (( L ‘𝑏) ∪ ( R ‘𝑏)))
191lrrecpred 27936 . . . . . . . . 9 (𝑐 No → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐) = (( L ‘𝑐) ∪ ( R ‘𝑐)))
20193ad2ant3 1136 . . . . . . . 8 ((𝑎 No 𝑏 No 𝑐 No ) → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐) = (( L ‘𝑐) ∪ ( R ‘𝑐)))
2120raleqdv 3295 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃))
2218, 21raleqbidv 3311 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃))
2316, 22raleqbidv 3311 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃))
2418raleqdv 3295 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒))
2516, 24raleqbidv 3311 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒))
2620raleqdv 3295 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁))
2716, 26raleqbidv 3311 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁))
2823, 25, 273anbi123d 1439 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁) ↔ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁)))
2916raleqdv 3295 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓))
3020raleqdv 3295 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏))
3118, 30raleqbidv 3311 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏))
3218raleqdv 3295 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎))
3329, 31, 323anbi123d 1439 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎) ↔ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎)))
3420raleqdv 3295 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜂 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂))
3528, 33, 343anbi123d 1439 . . 3 ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁) ∧ (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎) ∧ ∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜂) ↔ ((∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁) ∧ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎) ∧ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂)))
36 no3inds.i . . 3 ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁) ∧ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎) ∧ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂) → 𝜑))
3735, 36sylbid 240 . 2 ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁) ∧ (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎) ∧ ∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜂) → 𝜑))
382, 3, 4, 2, 3, 4, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 37xpord3ind 8106 1 ((𝑋 No 𝑌 No 𝑍 No ) → 𝜆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  w3a 1087   = wceq 1542  wcel 2114  wral 3051  cun 3887  {copab 5147  Predcpred 6264  cfv 6498   No csur 27603   L cleft 27817   R cright 27818
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  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 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-ot 4576  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-1o 8405  df-2o 8406  df-no 27606  df-lts 27607  df-bday 27608  df-slts 27750  df-cuts 27752  df-made 27819  df-old 27820  df-left 27822  df-right 27823
This theorem is referenced by:  leadds1  27981  addsass  27997  addsdi  28147  mulsass  28158
  Copyright terms: Public domain W3C validator