Theorem isstruct2r 13095

Description: The property of being a structure with components in (1^st ‘𝑋)...(2^nd ‘𝑋). (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 18-Jan-2023.)

Assertion

Ref	Expression
isstruct2r	⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → 𝐹 Struct 𝑋)

Proof of Theorem isstruct2r

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

Step	Hyp	Ref	Expression
1		simpll 527	. 2 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → 𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)))
2		simplr 529	. 2 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → Fun (𝐹 ∖ {∅}))
3		simprr 533	. 2 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → dom 𝐹 ⊆ (...‘𝑋))
4		simprl 531	. . . 4 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → 𝐹 ∈ 𝑉)
5	4	elexd 2816	. . 3 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → 𝐹 ∈ V)
6		elex 2814	. . . 4 ⊢ (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) → 𝑋 ∈ V)
7	6	ad2antrr 488	. . 3 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → 𝑋 ∈ V)
8		simpr 110	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
9	8	eleq1d 2300	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑥 ∈ ( ≤ ∩ (ℕ × ℕ)) ↔ 𝑋 ∈ ( ≤ ∩ (ℕ × ℕ))))
10		simpl 109	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → 𝑓 = 𝐹)
11	10	difeq1d 3324	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (𝑓 ∖ {∅}) = (𝐹 ∖ {∅}))
12	11	funeqd 5348	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (Fun (𝑓 ∖ {∅}) ↔ Fun (𝐹 ∖ {∅})))
13	10	dmeqd 4933	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → dom 𝑓 = dom 𝐹)
14	8	fveq2d 5643	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (...‘𝑥) = (...‘𝑋))
15	13, 14	sseq12d 3258	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → (dom 𝑓 ⊆ (...‘𝑥) ↔ dom 𝐹 ⊆ (...‘𝑋)))
16	9, 12, 15	3anbi123d 1348	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑥 = 𝑋) → ((𝑥 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝑓 ∖ {∅}) ∧ dom 𝑓 ⊆ (...‘𝑥)) ↔ (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋))))
17		df-struct 13086	. . . 4 ⊢ Struct = {⟨𝑓, 𝑥⟩ ∣ (𝑥 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝑓 ∖ {∅}) ∧ dom 𝑓 ⊆ (...‘𝑥))}
18	16, 17	brabga 4358	. . 3 ⊢ ((𝐹 ∈ V ∧ 𝑋 ∈ V) → (𝐹 Struct 𝑋 ↔ (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋))))
19	5, 7, 18	syl2anc 411	. 2 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → (𝐹 Struct 𝑋 ↔ (𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (...‘𝑋))))
20	1, 2, 3, 19	mpbir3and 1206	1 ⊢ (((𝑋 ∈ ( ≤ ∩ (ℕ × ℕ)) ∧ Fun (𝐹 ∖ {∅})) ∧ (𝐹 ∈ 𝑉 ∧ dom 𝐹 ⊆ (...‘𝑋))) → 𝐹 Struct 𝑋)

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 8215  ℕcn 9143  ...cfz 10243   Struct cstr 13080

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-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-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-struct 13086

This theorem is referenced by:  isstructr  13099