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

Theorem setsstruct 17398
Description: An extensible structure with a replaced slot is an extensible structure. (Contributed by AV, 9-Jun-2021.) (Revised by AV, 14-Nov-2021.)
Assertion
Ref Expression
setsstruct ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩) → (𝐺 sSet ⟨𝐼, 𝐸⟩) Struct ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩)

Proof of Theorem setsstruct
StepHypRef Expression
1 isstruct 17374 . . . . . 6 (𝐺 Struct ⟨𝑀, 𝑁⟩ ↔ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ Fun (𝐺 ∖ {∅}) ∧ dom 𝐺 ⊆ (𝑀...𝑁)))
2 simp2 1155 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → 𝐺 Struct ⟨𝑀, 𝑁⟩)
3 simp3l 1220 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → 𝐸 ∈ 𝑉)
4 1z 12766 . . . . . . . . . . . . . . . 16 1 ∈ ℤ
5 nnge1 12406 . . . . . . . . . . . . . . . 16 (𝑀 ∈ ℕ → 1 ≤ 𝑀)
6 eluzuzle 13014 . . . . . . . . . . . . . . . 16 ((1 ∈ ℤ ∧ 1 ≤ 𝑀) → (𝐼 ∈ (ℤ≥‘𝑀) → 𝐼 ∈ (ℤ≥‘1)))
74, 5, 6sylancr 599 . . . . . . . . . . . . . . 15 (𝑀 ∈ ℕ → (𝐼 ∈ (ℤ≥‘𝑀) → 𝐼 ∈ (ℤ≥‘1)))
8 elnnuz 13045 . . . . . . . . . . . . . . 15 (𝐼 ∈ ℕ ↔ 𝐼 ∈ (ℤ≥‘1))
97, 8imbitrrdi 255 . . . . . . . . . . . . . 14 (𝑀 ∈ ℕ → (𝐼 ∈ (ℤ≥‘𝑀) → 𝐼 ∈ ℕ))
109adantld 496 . . . . . . . . . . . . 13 (𝑀 ∈ ℕ → ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → 𝐼 ∈ ℕ))
11103ad2ant1 1151 . . . . . . . . . . . 12 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → 𝐼 ∈ ℕ))
1211a1d 26 . . . . . . . . . . 11 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → 𝐼 ∈ ℕ)))
13123imp 1128 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → 𝐼 ∈ ℕ)
142, 3, 133jca 1146 . . . . . . . . 9 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → (𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ))
15 op1stg 8047 . . . . . . . . . . . . . . . 16 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (1st ‘⟨𝑀, 𝑁⟩) = 𝑀)
1615breq2d 5120 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩) ↔ 𝐼 ≤ 𝑀))
17 eqidd 2764 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐼 = 𝐼)
1816, 17, 15ifbieq12d 4514 . . . . . . . . . . . . . 14 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)) = if(𝐼 ≤ 𝑀, 𝐼, 𝑀))
19183adant3 1150 . . . . . . . . . . . . 13 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)) = if(𝐼 ≤ 𝑀, 𝐼, 𝑀))
2019adantr 486 . . . . . . . . . . . 12 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)) = if(𝐼 ≤ 𝑀, 𝐼, 𝑀))
21 eluz2 13011 . . . . . . . . . . . . . . . 16 (𝐼 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀 ≤ 𝐼))
22 zre 12737 . . . . . . . . . . . . . . . . . . . 20 (𝐼 ∈ ℤ → 𝐼 ∈ ℝ)
2322rexrd 11398 . . . . . . . . . . . . . . . . . . 19 (𝐼 ∈ ℤ → 𝐼 ∈ ℝ*)
24233ad2ant2 1152 . . . . . . . . . . . . . . . . . 18 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀 ≤ 𝐼) → 𝐼 ∈ ℝ*)
25 zre 12737 . . . . . . . . . . . . . . . . . . . 20 (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
2625rexrd 11398 . . . . . . . . . . . . . . . . . . 19 (𝑀 ∈ ℤ → 𝑀 ∈ ℝ*)
27263ad2ant1 1151 . . . . . . . . . . . . . . . . . 18 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀 ≤ 𝐼) → 𝑀 ∈ ℝ*)
28 simp3 1156 . . . . . . . . . . . . . . . . . 18 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀 ≤ 𝐼) → 𝑀 ≤ 𝐼)
2924, 27, 283jca 1146 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀 ≤ 𝐼) → (𝐼 ∈ ℝ* ∧ 𝑀 ∈ ℝ* ∧ 𝑀 ≤ 𝐼))
3029a1d 26 . . . . . . . . . . . . . . . 16 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀 ≤ 𝐼) → ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → (𝐼 ∈ ℝ* ∧ 𝑀 ∈ ℝ* ∧ 𝑀 ≤ 𝐼)))
3121, 30sylbi 220 . . . . . . . . . . . . . . 15 (𝐼 ∈ (ℤ≥‘𝑀) → ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → (𝐼 ∈ ℝ* ∧ 𝑀 ∈ ℝ* ∧ 𝑀 ≤ 𝐼)))
3231adantl 487 . . . . . . . . . . . . . 14 ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → (𝐼 ∈ ℝ* ∧ 𝑀 ∈ ℝ* ∧ 𝑀 ≤ 𝐼)))
3332impcom 413 . . . . . . . . . . . . 13 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → (𝐼 ∈ ℝ* ∧ 𝑀 ∈ ℝ* ∧ 𝑀 ≤ 𝐼))
34 xrmineq 13350 . . . . . . . . . . . . 13 ((𝐼 ∈ ℝ* ∧ 𝑀 ∈ ℝ* ∧ 𝑀 ≤ 𝐼) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) = 𝑀)
3533, 34syl 18 . . . . . . . . . . . 12 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) = 𝑀)
3620, 35eqtr2d 2799 . . . . . . . . . . 11 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → 𝑀 = if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)))
37363adant2 1149 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → 𝑀 = if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)))
38 op2ndg 8048 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (2nd ‘⟨𝑀, 𝑁⟩) = 𝑁)
3938eqcomd 2769 . . . . . . . . . . . . . 14 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑁 = (2nd ‘⟨𝑀, 𝑁⟩))
4039breq2d 5120 . . . . . . . . . . . . 13 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐼 ≤ 𝑁 ↔ 𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩)))
4140, 39, 17ifbieq12d 4514 . . . . . . . . . . . 12 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) = if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼))
42413adant3 1150 . . . . . . . . . . 11 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) = if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼))
43423ad2ant1 1151 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) = if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼))
4437, 43opeq12d 4853 . . . . . . . . 9 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩)
4514, 44jca 521 . . . . . . . 8 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀))) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))
46453exp 1137 . . . . . . 7 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
47463ad2ant1 1151 . . . . . 6 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁) ∧ Fun (𝐺 ∖ {∅}) ∧ dom 𝐺 ⊆ (𝑀...𝑁)) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
481, 47sylbi 220 . . . . 5 (𝐺 Struct ⟨𝑀, 𝑁⟩ → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
4948pm2.43i 53 . . . 4 (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩)))
5049expdcom 420 . . 3 (𝐸 ∈ 𝑉 → (𝐼 ∈ (ℤ≥‘𝑀) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
51503imp 1128 . 2 ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))
52 setsstruct2 17396 . 2 (((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸 ∈ 𝑉 ∧ 𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩) → (𝐺 sSet ⟨𝐼, 𝐸⟩) Struct ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩)
5351, 52syl 18 1 ((𝐸 ∈ 𝑉 ∧ 𝐼 ∈ (ℤ≥‘𝑀) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩) → (𝐺 sSet ⟨𝐼, 𝐸⟩) Struct ⟨𝑀, if(𝐼 ≤ 𝑁, 𝑁, 𝐼)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  ifcif 4485  {csn 4588  ⟨cop 4840   class class class wbr 5108  dom cdm 5658  Fun wfun 6560  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  1c1 11240  ℝ*cxr 11381   ≤ cle 11383  ℕcn 12375  ℤcz 12733  ℤ≥cuz 13005  ...cfz 13679   Struct cstr 17368   sSet csts 17385
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-n0 12647  df-z 12734  df-uz 13006  df-fz 13680  df-struct 17369  df-sets 17386
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator