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

Theorem isstruct2im 13091
Description: The property of being a structure with components in (1st𝑋)...(2nd𝑋). (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 18-Jan-2023.)
Assertion
Ref Expression
isstruct2im (𝐹 Struct 𝑋 → (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋)))

Proof of Theorem isstruct2im
Dummy variables 𝑥 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brstruct 13090 . . . 4 Rel Struct
21brrelex12i 4768 . . 3 (𝐹 Struct 𝑋 → (𝐹 ∈ V ∧ 𝑋 ∈ V))
3 simpr 110 . . . . . 6 ((𝑓 = 𝐹𝑥 = 𝑋) → 𝑥 = 𝑋)
43eleq1d 2300 . . . . 5 ((𝑓 = 𝐹𝑥 = 𝑋) → (𝑥 ∈ ( ≤ ∩ (ℕ × ℕ)) ↔ 𝑋 ∈ ( ≤ ∩ (ℕ × ℕ))))
5 simpl 109 . . . . . . 7 ((𝑓 = 𝐹𝑥 = 𝑋) → 𝑓 = 𝐹)
65difeq1d 3324 . . . . . 6 ((𝑓 = 𝐹𝑥 = 𝑋) → (𝑓 ∖ {∅}) = (𝐹 ∖ {∅}))
76funeqd 5348 . . . . 5 ((𝑓 = 𝐹𝑥 = 𝑋) → (Fun (𝑓 ∖ {∅}) ↔ Fun (𝐹 ∖ {∅})))
85dmeqd 4933 . . . . . 6 ((𝑓 = 𝐹𝑥 = 𝑋) → dom 𝑓 = dom 𝐹)
93fveq2d 5643 . . . . . 6 ((𝑓 = 𝐹𝑥 = 𝑋) → (...‘𝑥) = (...‘𝑋))
108, 9sseq12d 3258 . . . . 5 ((𝑓 = 𝐹𝑥 = 𝑋) → (dom 𝑓 ⊆ (...‘𝑥) ↔ dom 𝐹 ⊆ (...‘𝑋)))
114, 7, 103anbi123d 1348 . . . 4 ((𝑓 = 𝐹𝑥 = 𝑋) → ((𝑥 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝑓 ∖ {∅}) ∧ dom 𝑓 ⊆ (...‘𝑥)) ↔ (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋))))
12 df-struct 13083 . . . 4 Struct = {⟨𝑓, 𝑥⟩ ∣ (𝑥 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝑓 ∖ {∅}) ∧ dom 𝑓 ⊆ (...‘𝑥))}
1311, 12brabga 4358 . . 3 ((𝐹 ∈ V ∧ 𝑋 ∈ V) → (𝐹 Struct 𝑋 ↔ (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋))))
142, 13syl 14 . 2 (𝐹 Struct 𝑋 → (𝐹 Struct 𝑋 ↔ (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋))))
1514ibi 176 1 (𝐹 Struct 𝑋 → (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1004   = wceq 1397  wcel 2202  Vcvv 2802  cdif 3197  cin 3199  wss 3200  c0 3494  {csn 3669   class class class wbr 4088   × cxp 4723  dom cdm 4725  Fun wfun 5320  cfv 5326  cle 8214  cn 9142  ...cfz 10242   Struct cstr 13077
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 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-struct 13083
This theorem is referenced by:  structn0fun  13094  isstructim  13095
  Copyright terms: Public domain W3C validator