ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isstructr GIF version

Theorem isstructr 13120
Description: The property of being a structure with components in 𝑀...𝑁. (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 18-Jan-2023.)
Assertion
Ref Expression
isstructr (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (Fun (𝐹 ∖ {∅}) ∧ 𝐹𝑉 ∧ dom 𝐹 ⊆ (𝑀...𝑁))) → 𝐹 Struct ⟨𝑀, 𝑁⟩)

Proof of Theorem isstructr
StepHypRef Expression
1 brinxp2 4795 . . . 4 (𝑀( ≤ ∩ (ℕ × ℕ))𝑁 ↔ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁))
2 df-br 4090 . . . 4 (𝑀( ≤ ∩ (ℕ × ℕ))𝑁 ↔ ⟨𝑀, 𝑁⟩ ∈ ( ≤ ∩ (ℕ × ℕ)))
31, 2sylbb1 137 . . 3 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → ⟨𝑀, 𝑁⟩ ∈ ( ≤ ∩ (ℕ × ℕ)))
43adantr 276 . 2 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (Fun (𝐹 ∖ {∅}) ∧ 𝐹𝑉 ∧ dom 𝐹 ⊆ (𝑀...𝑁))) → ⟨𝑀, 𝑁⟩ ∈ ( ≤ ∩ (ℕ × ℕ)))
5 simpr1 1029 . 2 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (Fun (𝐹 ∖ {∅}) ∧ 𝐹𝑉 ∧ dom 𝐹 ⊆ (𝑀...𝑁))) → Fun (𝐹 ∖ {∅}))
6 simpr2 1030 . 2 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (Fun (𝐹 ∖ {∅}) ∧ 𝐹𝑉 ∧ dom 𝐹 ⊆ (𝑀...𝑁))) → 𝐹𝑉)
7 df-ov 6026 . . . . . 6 (𝑀...𝑁) = (...‘⟨𝑀, 𝑁⟩)
87sseq2i 3253 . . . . 5 (dom 𝐹 ⊆ (𝑀...𝑁) ↔ dom 𝐹 ⊆ (...‘⟨𝑀, 𝑁⟩))
98biimpi 120 . . . 4 (dom 𝐹 ⊆ (𝑀...𝑁) → dom 𝐹 ⊆ (...‘⟨𝑀, 𝑁⟩))
1093ad2ant3 1046 . . 3 ((Fun (𝐹 ∖ {∅}) ∧ 𝐹𝑉 ∧ dom 𝐹 ⊆ (𝑀...𝑁)) → dom 𝐹 ⊆ (...‘⟨𝑀, 𝑁⟩))
1110adantl 277 . 2 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (Fun (𝐹 ∖ {∅}) ∧ 𝐹𝑉 ∧ dom 𝐹 ⊆ (𝑀...𝑁))) → dom 𝐹 ⊆ (...‘⟨𝑀, 𝑁⟩))
12 isstruct2r 13116 . 2 (((⟨𝑀, 𝑁⟩ ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹𝑉 ∧ dom 𝐹 ⊆ (...‘⟨𝑀, 𝑁⟩))) → 𝐹 Struct ⟨𝑀, 𝑁⟩)
134, 5, 6, 11, 12syl22anc 1274 1 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (Fun (𝐹 ∖ {∅}) ∧ 𝐹𝑉 ∧ dom 𝐹 ⊆ (𝑀...𝑁))) → 𝐹 Struct ⟨𝑀, 𝑁⟩)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1004  wcel 2201  cdif 3196  cin 3198  wss 3199  c0 3493  {csn 3670  cop 3673   class class class wbr 4089   × cxp 4725  dom cdm 4727  Fun wfun 5322  cfv 5328  (class class class)co 6023  cle 8220  cn 9148  ...cfz 10248   Struct cstr 13101
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-rab 2518  df-v 2803  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-br 4090  df-opab 4152  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-iota 5288  df-fun 5330  df-fv 5336  df-ov 6026  df-struct 13107
This theorem is referenced by:  strleund  13209  strleun  13210  strext  13211  strle1g  13212
  Copyright terms: Public domain W3C validator