Theorem opfi1uzind 14624

Description: Properties of an ordered pair with a finite first component with at least L elements, proven by finite induction on the size of the first component. This theorem can be applied for graphs (represented as ordered pairs of vertices and edges) with a finite number of vertices, usually with 𝐿 = 0 (see opfi1ind 14625) or 𝐿 = 1. (Contributed by AV, 22-Oct-2020.) (Revised by AV, 28-Mar-2021.)

Hypotheses

Ref	Expression
opfi1uzind.e	⊢ 𝐸 ∈ V
opfi1uzind.f	⊢ 𝐹 ∈ V
opfi1uzind.l	⊢ 𝐿 ∈ ℕ0
opfi1uzind.1	⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝜓 ↔ 𝜑))
opfi1uzind.2	⊢ ((𝑣 = 𝑤 ∧ 𝑒 = 𝑓) → (𝜓 ↔ 𝜃))
opfi1uzind.3	⊢ ((⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ 𝑛 ∈ 𝑣) → ⟨(𝑣 ∖ {𝑛}), 𝐹⟩ ∈ 𝐺)
opfi1uzind.4	⊢ ((𝑤 = (𝑣 ∖ {𝑛}) ∧ 𝑓 = 𝐹) → (𝜃 ↔ 𝜒))
opfi1uzind.base	⊢ ((⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ (♯‘𝑣) = 𝐿) → 𝜓)
opfi1uzind.step	⊢ ((((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) ∧ 𝜒) → 𝜓)

Assertion

Ref	Expression
opfi1uzind	⊢ ((⟨𝑉, 𝐸⟩ ∈ 𝐺 ∧ 𝑉 ∈ Fin ∧ 𝐿 ≤ (♯‘𝑉)) → 𝜑)

Distinct variable groups:   𝑒,𝑛,𝑣,𝑦   𝑒,𝐸,𝑛,𝑣   𝑓,𝐹,𝑤   𝑒,𝐺,𝑓,𝑛,𝑣,𝑤,𝑦   𝑒,𝑉,𝑛,𝑣   𝜓,𝑓,𝑛,𝑤,𝑦   𝜃,𝑒,𝑛,𝑣   𝜒,𝑓,𝑤   𝜑,𝑒,𝑛,𝑣   𝑒,𝐿,𝑛,𝑣,𝑦

Allowed substitution hints:   𝜑(𝑦, 𝑤, 𝑓)   𝜓(𝑣, 𝑒)   𝜒(𝑦, 𝑣, 𝑒, 𝑛)   𝜃(𝑦, 𝑤, 𝑓)   𝐸(𝑦, 𝑤, 𝑓)   𝐹(𝑦, 𝑣, 𝑒, 𝑛)   𝐿(𝑤, 𝑓)   𝑉(𝑦, 𝑤, 𝑓)

Proof of Theorem opfi1uzind

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opfi1uzind.e	. . . . . . 7 ⊢ 𝐸 ∈ V
2	1	a1i 11	. . . . . 6 ⊢ (𝑎 = 𝑉 → 𝐸 ∈ V)
3		opeq12 4834	. . . . . . 7 ⊢ ((𝑎 = 𝑉 ∧ 𝑏 = 𝐸) → ⟨𝑎, 𝑏⟩ = ⟨𝑉, 𝐸⟩)
4	3	eleq1d 2845	. . . . . 6 ⊢ ((𝑎 = 𝑉 ∧ 𝑏 = 𝐸) → (⟨𝑎, 𝑏⟩ ∈ 𝐺 ↔ ⟨𝑉, 𝐸⟩ ∈ 𝐺))
5	2, 4	sbcied 3781	. . . . 5 ⊢ (𝑎 = 𝑉 → ([𝐸 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ↔ ⟨𝑉, 𝐸⟩ ∈ 𝐺))
6	5	sbcieg 3777	. . . 4 ⊢ (𝑉 ∈ Fin → ([𝑉 / 𝑎][𝐸 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ↔ ⟨𝑉, 𝐸⟩ ∈ 𝐺))
7	6	biimparc 485	. . 3 ⊢ ((⟨𝑉, 𝐸⟩ ∈ 𝐺 ∧ 𝑉 ∈ Fin) → [𝑉 / 𝑎][𝐸 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺)
8	7	3adant3 1150	. 2 ⊢ ((⟨𝑉, 𝐸⟩ ∈ 𝐺 ∧ 𝑉 ∈ Fin ∧ 𝐿 ≤ (♯‘𝑉)) → [𝑉 / 𝑎][𝐸 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺)
9		opfi1uzind.f	. . 3 ⊢ 𝐹 ∈ V
10		opfi1uzind.l	. . 3 ⊢ 𝐿 ∈ ℕ0
11		opfi1uzind.1	. . 3 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝜓 ↔ 𝜑))
12		opfi1uzind.2	. . 3 ⊢ ((𝑣 = 𝑤 ∧ 𝑒 = 𝑓) → (𝜓 ↔ 𝜃))
13		vex 3454	. . . . . 6 ⊢ 𝑣 ∈ V
14		vex 3454	. . . . . 6 ⊢ 𝑒 ∈ V
15		opeq12 4834	. . . . . . 7 ⊢ ((𝑎 = 𝑣 ∧ 𝑏 = 𝑒) → ⟨𝑎, 𝑏⟩ = ⟨𝑣, 𝑒⟩)
16	15	eleq1d 2845	. . . . . 6 ⊢ ((𝑎 = 𝑣 ∧ 𝑏 = 𝑒) → (⟨𝑎, 𝑏⟩ ∈ 𝐺 ↔ ⟨𝑣, 𝑒⟩ ∈ 𝐺))
17	13, 14, 16	sbc2ie 3813	. . . . 5 ⊢ ([𝑣 / 𝑎][𝑒 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ↔ ⟨𝑣, 𝑒⟩ ∈ 𝐺)
18		opfi1uzind.3	. . . . 5 ⊢ ((⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ 𝑛 ∈ 𝑣) → ⟨(𝑣 ∖ {𝑛}), 𝐹⟩ ∈ 𝐺)
19	17, 18	sylanb 593	. . . 4 ⊢ (([𝑣 / 𝑎][𝑒 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ∧ 𝑛 ∈ 𝑣) → ⟨(𝑣 ∖ {𝑛}), 𝐹⟩ ∈ 𝐺)
20	13	difexi 5291	. . . . 5 ⊢ (𝑣 ∖ {𝑛}) ∈ V
21		opeq12 4834	. . . . . 6 ⊢ ((𝑎 = (𝑣 ∖ {𝑛}) ∧ 𝑏 = 𝐹) → ⟨𝑎, 𝑏⟩ = ⟨(𝑣 ∖ {𝑛}), 𝐹⟩)
22	21	eleq1d 2845	. . . . 5 ⊢ ((𝑎 = (𝑣 ∖ {𝑛}) ∧ 𝑏 = 𝐹) → (⟨𝑎, 𝑏⟩ ∈ 𝐺 ↔ ⟨(𝑣 ∖ {𝑛}), 𝐹⟩ ∈ 𝐺))
23	20, 9, 22	sbc2ie 3813	. . . 4 ⊢ ([(𝑣 ∖ {𝑛}) / 𝑎][𝐹 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ↔ ⟨(𝑣 ∖ {𝑛}), 𝐹⟩ ∈ 𝐺)
24	19, 23	sylibr 237	. . 3 ⊢ (([𝑣 / 𝑎][𝑒 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ∧ 𝑛 ∈ 𝑣) → [(𝑣 ∖ {𝑛}) / 𝑎][𝐹 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺)
25		opfi1uzind.4	. . 3 ⊢ ((𝑤 = (𝑣 ∖ {𝑛}) ∧ 𝑓 = 𝐹) → (𝜃 ↔ 𝜒))
26		opfi1uzind.base	. . . 4 ⊢ ((⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ (♯‘𝑣) = 𝐿) → 𝜓)
27	17, 26	sylanb 593	. . 3 ⊢ (([𝑣 / 𝑎][𝑒 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ∧ (♯‘𝑣) = 𝐿) → 𝜓)
28	17	3anbi1i 1175	. . . . 5 ⊢ (([𝑣 / 𝑎][𝑒 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣) ↔ (⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣))
29	28	anbi2i 635	. . . 4 ⊢ (((𝑦 + 1) ∈ ℕ0 ∧ ([𝑣 / 𝑎][𝑒 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) ↔ ((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)))
30		opfi1uzind.step	. . . 4 ⊢ ((((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑣, 𝑒⟩ ∈ 𝐺 ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) ∧ 𝜒) → 𝜓)
31	29, 30	sylanb 593	. . 3 ⊢ ((((𝑦 + 1) ∈ ℕ0 ∧ ([𝑣 / 𝑎][𝑒 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ∧ (♯‘𝑣) = (𝑦 + 1) ∧ 𝑛 ∈ 𝑣)) ∧ 𝜒) → 𝜓)
32	9, 10, 11, 12, 24, 25, 27, 31	fi1uzind 14620	. 2 ⊢ (([𝑉 / 𝑎][𝐸 / 𝑏]⟨𝑎, 𝑏⟩ ∈ 𝐺 ∧ 𝑉 ∈ Fin ∧ 𝐿 ≤ (♯‘𝑉)) → 𝜑)
33	8, 32	syld3an1 1437	1 ⊢ ((⟨𝑉, 𝐸⟩ ∈ 𝐺 ∧ 𝑉 ∈ Fin ∧ 𝐿 ≤ (♯‘𝑉)) → 𝜑)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3450  [wsbc 3738   ∖ cdif 3895  {csn 4583  ⟨cop 4589   class class class wbr 5102  ‘cfv 6527  (class class class)co 7408  Fincfn 8951  1c1 11173   + caddc 11175   ≤ cle 11316  ℕ₀cn0 12576  ♯chash 14442

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-cnex 11228  ax-resscn 11229  ax-1cn 11230  ax-icn 11231  ax-addcl 11232  ax-addrcl 11233  ax-mulcl 11234  ax-mulrcl 11235  ax-mulcom 11236  ax-addass 11237  ax-mulass 11238  ax-distr 11239  ax-i2m1 11240  ax-1ne0 11241  ax-1rid 11242  ax-rnegex 11243  ax-rrecex 11244  ax-cnre 11245  ax-pre-lttri 11246  ax-pre-lttrn 11247  ax-pre-ltadd 11248  ax-pre-mulgt0 11249

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-oadd 8458  df-er 8695  df-en 8952  df-dom 8953  df-sdom 8954  df-fin 8955  df-dju 9954  df-card 9992  df-pnf 11317  df-mnf 11318  df-xr 11319  df-ltxr 11320  df-le 11321  df-sub 11515  df-neg 11516  df-nn 12306  df-n0 12577  df-xnn0 12650  df-z 12664  df-uz 12936  df-fz 13610  df-hash 14443

This theorem is used by:  opfi1ind  14625