Theorem 1strwunbndx 17429

Description: A constructed one-slot structure in a weak universe containing the index of the base set extractor. (Contributed by AV, 27-Mar-2020.)

Hypotheses

Ref	Expression
1str.g	⊢ 𝐺 = {⟨(Base‘ndx), 𝐵⟩}
1strwun.u	⊢ (𝜑 → 𝑈 ∈ WUni)
1strwunbndx.b	⊢ (𝜑 → (Base‘ndx) ∈ 𝑈)

Assertion

Ref	Expression
1strwunbndx	⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐺 ∈ 𝑈)

Proof of Theorem 1strwunbndx

Step	Hyp	Ref	Expression
1		1str.g	. 2 ⊢ 𝐺 = {⟨(Base‘ndx), 𝐵⟩}
2		1strwun.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ WUni)
3	2	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝑈 ∈ WUni)
4		1strwunbndx.b	. . . . 5 ⊢ (𝜑 → (Base‘ndx) ∈ 𝑈)
5	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → (Base‘ndx) ∈ 𝑈)
6		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐵 ∈ 𝑈)
7	3, 5, 6	wunop 10831	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → ⟨(Base‘ndx), 𝐵⟩ ∈ 𝑈)
8	3, 7	wunsn 10825	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → {⟨(Base‘ndx), 𝐵⟩} ∈ 𝑈)
9	1, 8	eqeltrid 2868	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐺 ∈ 𝑈)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {csn 4588  ⟨cop 4838  ‘cfv 6555  WUnicwun 10809  ndxcnx 17397  Basecbs 17413

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-tr 5216  df-wun 10811

This theorem is used by:  1strwun  17430  equivestrcsetc  18352